./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.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', '19a60273c9036fd322b397de31454eb141b9f154ab77bf61e90ba0f48087b2d9'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.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 19a60273c9036fd322b397de31454eb141b9f154ab77bf61e90ba0f48087b2d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:46:20,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:46:20,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 05:46:20,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:46:20,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:46:20,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:46:20,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:46:20,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:46:20,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:46:20,235 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:46:20,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:46:20,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:46:20,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:46:20,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:46:20,236 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:46:20,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:46:20,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:46:20,236 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:46:20,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:46:20,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:46:20,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:46:20,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:46:20,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:46:20,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:46:20,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:46:20,236 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:46:20,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:46:20,237 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:46:20,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:46:20,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:46:20,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:46:20,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:46:20,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:46:20,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:46:20,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:46:20,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:46:20,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:46:20,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:46:20,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:46:20,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:46:20,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:46:20,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:46:20,240 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 -> 19a60273c9036fd322b397de31454eb141b9f154ab77bf61e90ba0f48087b2d9 [2024-11-07 05:46:20,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:46:20,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:46:20,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:46:20,439 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:46:20,439 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:46:20,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i [2024-11-07 05:46:21,666 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:46:21,867 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:46:21,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i [2024-11-07 05:46:21,875 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44dc494c8/9a0c88c426ce4ab382d8b4827dc99458/FLAGac374af4b [2024-11-07 05:46:21,891 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44dc494c8/9a0c88c426ce4ab382d8b4827dc99458 [2024-11-07 05:46:21,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:46:21,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:46:21,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:46:21,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:46:21,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:46:21,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:46:21" (1/1) ... [2024-11-07 05:46:21,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20459f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:21, skipping insertion in model container [2024-11-07 05:46:21,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:46:21" (1/1) ... [2024-11-07 05:46:21,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:46:22,031 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i[919,932] [2024-11-07 05:46:22,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:46:22,097 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:46:22,106 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i[919,932] [2024-11-07 05:46:22,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:46:22,159 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:46:22,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:22 WrapperNode [2024-11-07 05:46:22,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:46:22,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:46:22,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:46:22,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:46:22,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:22" (1/1) ... [2024-11-07 05:46:22,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:22" (1/1) ... [2024-11-07 05:46:22,212 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-11-07 05:46:22,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:46:22,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:46:22,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:46:22,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:46:22,222 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:22" (1/1) ... [2024-11-07 05:46:22,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:22" (1/1) ... [2024-11-07 05:46:22,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:22" (1/1) ... [2024-11-07 05:46:22,246 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 05:46:22,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:22" (1/1) ... [2024-11-07 05:46:22,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:22" (1/1) ... [2024-11-07 05:46:22,258 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:22" (1/1) ... [2024-11-07 05:46:22,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:22" (1/1) ... [2024-11-07 05:46:22,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:22" (1/1) ... [2024-11-07 05:46:22,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:22" (1/1) ... [2024-11-07 05:46:22,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:46:22,277 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:46:22,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:46:22,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:46:22,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:22" (1/1) ... [2024-11-07 05:46:22,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:46:22,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:46:22,311 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 05:46:22,314 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 05:46:22,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:46:22,333 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:46:22,333 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:46:22,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:46:22,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:46:22,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:46:22,433 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:46:22,435 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:46:22,716 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-07 05:46:22,716 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:46:22,728 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:46:22,728 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:46:22,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:46:22 BoogieIcfgContainer [2024-11-07 05:46:22,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:46:22,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:46:22,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:46:22,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:46:22,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:46:21" (1/3) ... [2024-11-07 05:46:22,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12dadd39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:46:22, skipping insertion in model container [2024-11-07 05:46:22,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:22" (2/3) ... [2024-11-07 05:46:22,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12dadd39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:46:22, skipping insertion in model container [2024-11-07 05:46:22,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:46:22" (3/3) ... [2024-11-07 05:46:22,736 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i [2024-11-07 05:46:22,747 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:46:22,747 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:46:22,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:46:22,805 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;@6e6f394f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:46:22,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:46:22,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 05:46:22,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 05:46:22,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:22,821 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:22,821 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:22,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:22,826 INFO L85 PathProgramCache]: Analyzing trace with hash 293078757, now seen corresponding path program 1 times [2024-11-07 05:46:22,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:46:22,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968532148] [2024-11-07 05:46:22,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:22,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:46:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:46:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:46:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:46:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:46:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:46:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:46:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:46:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:46:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:46:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:46:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:46:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:46:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:46:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:46:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:46:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:46:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 05:46:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:46:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 05:46:23,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:46:23,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968532148] [2024-11-07 05:46:23,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968532148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:46:23,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:46:23,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:46:23,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019245464] [2024-11-07 05:46:23,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:46:23,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:46:23,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:46:23,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:46:23,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:46:23,113 INFO L87 Difference]: Start difference. First operand has 72 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 05:46:23,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:46:23,130 INFO L93 Difference]: Finished difference Result 136 states and 236 transitions. [2024-11-07 05:46:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:46:23,132 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2024-11-07 05:46:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:46:23,136 INFO L225 Difference]: With dead ends: 136 [2024-11-07 05:46:23,136 INFO L226 Difference]: Without dead ends: 67 [2024-11-07 05:46:23,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 05:46:23,143 INFO L432 NwaCegarLoop]: 103 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, 103 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 05:46:23,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:46:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-07 05:46:23,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-07 05:46:23,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.425531914893617) internal successors, (67), 47 states have internal predecessors, (67), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 05:46:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2024-11-07 05:46:23,181 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 129 [2024-11-07 05:46:23,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:46:23,181 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2024-11-07 05:46:23,182 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 05:46:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2024-11-07 05:46:23,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 05:46:23,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:23,185 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:23,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:46:23,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:23,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:23,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2013606881, now seen corresponding path program 1 times [2024-11-07 05:46:23,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:46:23,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734893922] [2024-11-07 05:46:23,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:23,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:46:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:46:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:46:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:46:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:46:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:46:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:46:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:46:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:46:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:46:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:46:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:46:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:46:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:46:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:46:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:46:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:46:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 05:46:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:46:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 05:46:23,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:46:23,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734893922] [2024-11-07 05:46:23,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734893922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:46:23,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:46:23,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:46:23,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91793695] [2024-11-07 05:46:23,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:46:23,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:46:23,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:46:23,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:46:23,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:46:23,726 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:46:23,845 INFO L93 Difference]: Finished difference Result 196 states and 304 transitions. [2024-11-07 05:46:23,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:46:23,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-11-07 05:46:23,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:46:23,848 INFO L225 Difference]: With dead ends: 196 [2024-11-07 05:46:23,848 INFO L226 Difference]: Without dead ends: 132 [2024-11-07 05:46:23,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:46:23,849 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 90 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:46:23,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 289 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:46:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-07 05:46:23,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 102. [2024-11-07 05:46:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 05:46:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2024-11-07 05:46:23,863 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 129 [2024-11-07 05:46:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:46:23,864 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2024-11-07 05:46:23,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2024-11-07 05:46:23,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 05:46:23,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:23,865 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:23,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:46:23,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:23,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:23,866 INFO L85 PathProgramCache]: Analyzing trace with hash -105600659, now seen corresponding path program 1 times [2024-11-07 05:46:23,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:46:23,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188094123] [2024-11-07 05:46:23,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:23,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:46:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:46:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:46:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:46:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:46:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:46:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:46:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:46:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:46:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:46:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:46:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:46:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:46:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:46:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:46:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:46:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:46:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 05:46:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:46:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 05:46:24,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:46:24,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188094123] [2024-11-07 05:46:24,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188094123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:46:24,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:46:24,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:46:24,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438912935] [2024-11-07 05:46:24,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:46:24,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:46:24,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:46:24,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:46:24,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:46:24,102 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:24,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:46:24,187 INFO L93 Difference]: Finished difference Result 230 states and 355 transitions. [2024-11-07 05:46:24,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:46:24,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-07 05:46:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:46:24,190 INFO L225 Difference]: With dead ends: 230 [2024-11-07 05:46:24,192 INFO L226 Difference]: Without dead ends: 166 [2024-11-07 05:46:24,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 05:46:24,193 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 85 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:46:24,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 232 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:46:24,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-07 05:46:24,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 115. [2024-11-07 05:46:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 05:46:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 177 transitions. [2024-11-07 05:46:24,219 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 177 transitions. Word has length 130 [2024-11-07 05:46:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:46:24,219 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 177 transitions. [2024-11-07 05:46:24,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 177 transitions. [2024-11-07 05:46:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 05:46:24,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:24,222 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:24,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:46:24,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:24,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash 574457711, now seen corresponding path program 1 times [2024-11-07 05:46:24,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:46:24,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970995012] [2024-11-07 05:46:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:24,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:46:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:46:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:46:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:46:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:46:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:46:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:46:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:46:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:46:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:46:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:46:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:46:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:46:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:46:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:46:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:46:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:46:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 05:46:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:46:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 05:46:24,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:46:24,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970995012] [2024-11-07 05:46:24,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970995012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:46:24,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:46:24,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:46:24,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85559870] [2024-11-07 05:46:24,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:46:24,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:46:24,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:46:24,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:46:24,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:46:24,462 INFO L87 Difference]: Start difference. First operand 115 states and 177 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:24,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:46:24,643 INFO L93 Difference]: Finished difference Result 244 states and 375 transitions. [2024-11-07 05:46:24,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:46:24,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-07 05:46:24,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:46:24,647 INFO L225 Difference]: With dead ends: 244 [2024-11-07 05:46:24,647 INFO L226 Difference]: Without dead ends: 167 [2024-11-07 05:46:24,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:46:24,648 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 83 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:46:24,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 152 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:46:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-07 05:46:24,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2024-11-07 05:46:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 121 states have (on average 1.43801652892562) internal successors, (174), 122 states have internal predecessors, (174), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 05:46:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 250 transitions. [2024-11-07 05:46:24,661 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 250 transitions. Word has length 130 [2024-11-07 05:46:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:46:24,661 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 250 transitions. [2024-11-07 05:46:24,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 250 transitions. [2024-11-07 05:46:24,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 05:46:24,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:24,663 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:24,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 05:46:24,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:24,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:24,663 INFO L85 PathProgramCache]: Analyzing trace with hash 517199409, now seen corresponding path program 1 times [2024-11-07 05:46:24,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:46:24,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728424220] [2024-11-07 05:46:24,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:24,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:46:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:46:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:46:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:46:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:46:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:46:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:46:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:46:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:46:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:46:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:46:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:46:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:46:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:46:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:46:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:46:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:46:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 05:46:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:46:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 05:46:24,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:46:24,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728424220] [2024-11-07 05:46:24,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728424220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:46:24,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:46:24,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 05:46:24,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180484941] [2024-11-07 05:46:24,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:46:24,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:46:24,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:46:24,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:46:24,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:46:24,960 INFO L87 Difference]: Start difference. First operand 164 states and 250 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:46:25,216 INFO L93 Difference]: Finished difference Result 519 states and 825 transitions. [2024-11-07 05:46:25,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 05:46:25,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-07 05:46:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:46:25,220 INFO L225 Difference]: With dead ends: 519 [2024-11-07 05:46:25,220 INFO L226 Difference]: Without dead ends: 397 [2024-11-07 05:46:25,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:46:25,221 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 154 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:46:25,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 450 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:46:25,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-07 05:46:25,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 239. [2024-11-07 05:46:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 177 states have (on average 1.4576271186440677) internal successors, (258), 178 states have internal predecessors, (258), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 05:46:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 370 transitions. [2024-11-07 05:46:25,268 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 370 transitions. Word has length 130 [2024-11-07 05:46:25,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:46:25,268 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 370 transitions. [2024-11-07 05:46:25,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 370 transitions. [2024-11-07 05:46:25,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 05:46:25,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:25,269 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:25,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 05:46:25,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:25,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:25,270 INFO L85 PathProgramCache]: Analyzing trace with hash 383185903, now seen corresponding path program 1 times [2024-11-07 05:46:25,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:46:25,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070123479] [2024-11-07 05:46:25,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:25,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:46:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:46:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:46:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:46:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:46:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:46:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:46:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:46:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:46:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:46:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:46:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:46:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:46:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:46:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:46:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:46:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:46:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 05:46:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:46:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 05:46:25,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:46:25,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070123479] [2024-11-07 05:46:25,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070123479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:46:25,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:46:25,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:46:25,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579876700] [2024-11-07 05:46:25,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:46:25,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:46:25,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:46:25,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:46:25,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:46:25,551 INFO L87 Difference]: Start difference. First operand 239 states and 370 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:25,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:46:25,784 INFO L93 Difference]: Finished difference Result 436 states and 682 transitions. [2024-11-07 05:46:25,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:46:25,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-07 05:46:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:46:25,786 INFO L225 Difference]: With dead ends: 436 [2024-11-07 05:46:25,786 INFO L226 Difference]: Without dead ends: 239 [2024-11-07 05:46:25,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:46:25,787 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 98 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:46:25,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 135 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:46:25,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-07 05:46:25,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-11-07 05:46:25,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 177 states have (on average 1.423728813559322) internal successors, (252), 178 states have internal predecessors, (252), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 05:46:25,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 364 transitions. [2024-11-07 05:46:25,823 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 364 transitions. Word has length 130 [2024-11-07 05:46:25,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:46:25,823 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 364 transitions. [2024-11-07 05:46:25,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:25,823 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 364 transitions. [2024-11-07 05:46:25,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 05:46:25,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:25,825 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:25,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 05:46:25,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:25,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:25,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1610958803, now seen corresponding path program 1 times [2024-11-07 05:46:25,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:46:25,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982472418] [2024-11-07 05:46:25,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:25,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:46:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:46:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:46:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:46:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:46:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:46:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:46:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:46:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:46:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:46:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:46:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:46:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:46:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:46:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:46:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:46:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:46:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 05:46:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:46:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,388 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 45 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-07 05:46:26,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:46:26,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982472418] [2024-11-07 05:46:26,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982472418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:46:26,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245593430] [2024-11-07 05:46:26,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:26,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:46:26,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:46:26,394 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 05:46:26,409 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 05:46:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:26,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 05:46:26,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:46:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 45 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-07 05:46:26,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:46:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 48 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-07 05:46:27,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245593430] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:46:27,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:46:27,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-07 05:46:27,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348146768] [2024-11-07 05:46:27,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:46:27,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 05:46:27,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:46:27,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 05:46:27,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-07 05:46:27,183 INFO L87 Difference]: Start difference. First operand 239 states and 364 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-07 05:46:27,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:46:27,997 INFO L93 Difference]: Finished difference Result 774 states and 1130 transitions. [2024-11-07 05:46:27,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-07 05:46:27,997 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 130 [2024-11-07 05:46:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:46:28,000 INFO L225 Difference]: With dead ends: 774 [2024-11-07 05:46:28,001 INFO L226 Difference]: Without dead ends: 652 [2024-11-07 05:46:28,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2024-11-07 05:46:28,002 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 248 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 05:46:28,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 747 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 05:46:28,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-07 05:46:28,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 401. [2024-11-07 05:46:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 309 states have (on average 1.3883495145631068) internal successors, (429), 311 states have internal predecessors, (429), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-07 05:46:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 581 transitions. [2024-11-07 05:46:28,042 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 581 transitions. Word has length 130 [2024-11-07 05:46:28,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:46:28,043 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 581 transitions. [2024-11-07 05:46:28,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-07 05:46:28,043 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 581 transitions. [2024-11-07 05:46:28,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 05:46:28,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:28,045 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:28,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 05:46:28,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:46:28,246 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:28,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:28,247 INFO L85 PathProgramCache]: Analyzing trace with hash 878570159, now seen corresponding path program 1 times [2024-11-07 05:46:28,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:46:28,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395881907] [2024-11-07 05:46:28,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:28,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:46:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:46:28,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1453987583] [2024-11-07 05:46:28,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:28,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:46:28,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:46:28,295 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 05:46:28,296 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 05:46:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:28,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 05:46:28,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:46:29,028 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-07 05:46:29,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:46:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-07 05:46:30,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:46:30,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395881907] [2024-11-07 05:46:30,486 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 05:46:30,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453987583] [2024-11-07 05:46:30,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453987583] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:46:30,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:46:30,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2024-11-07 05:46:30,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206927881] [2024-11-07 05:46:30,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:46:30,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 05:46:30,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:46:30,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 05:46:30,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-11-07 05:46:30,488 INFO L87 Difference]: Start difference. First operand 401 states and 581 transitions. Second operand has 19 states, 19 states have (on average 4.526315789473684) internal successors, (86), 19 states have internal predecessors, (86), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-07 05:46:38,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:46:38,945 INFO L93 Difference]: Finished difference Result 1779 states and 2518 transitions. [2024-11-07 05:46:38,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-07 05:46:38,946 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.526315789473684) internal successors, (86), 19 states have internal predecessors, (86), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 130 [2024-11-07 05:46:38,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:46:38,951 INFO L225 Difference]: With dead ends: 1779 [2024-11-07 05:46:38,951 INFO L226 Difference]: Without dead ends: 1442 [2024-11-07 05:46:38,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=737, Invalid=2343, Unknown=0, NotChecked=0, Total=3080 [2024-11-07 05:46:38,953 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 1371 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 05:46:38,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 729 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 05:46:38,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2024-11-07 05:46:39,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 807. [2024-11-07 05:46:39,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 639 states have (on average 1.3959311424100156) internal successors, (892), 643 states have internal predecessors, (892), 134 states have call successors, (134), 33 states have call predecessors, (134), 33 states have return successors, (134), 130 states have call predecessors, (134), 134 states have call successors, (134) [2024-11-07 05:46:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1160 transitions. [2024-11-07 05:46:39,082 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1160 transitions. Word has length 130 [2024-11-07 05:46:39,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:46:39,082 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1160 transitions. [2024-11-07 05:46:39,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.526315789473684) internal successors, (86), 19 states have internal predecessors, (86), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-07 05:46:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1160 transitions. [2024-11-07 05:46:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 05:46:39,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:39,084 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:39,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 05:46:39,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:46:39,288 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:39,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:39,289 INFO L85 PathProgramCache]: Analyzing trace with hash 704397867, now seen corresponding path program 1 times [2024-11-07 05:46:39,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:46:39,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892519379] [2024-11-07 05:46:39,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:39,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:46:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:46:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:46:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:46:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:46:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:46:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:46:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:46:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:46:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:46:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:46:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:46:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:46:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:46:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:46:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:46:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:46:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 05:46:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:46:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 05:46:39,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:46:39,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892519379] [2024-11-07 05:46:39,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892519379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:46:39,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:46:39,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 05:46:39,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133799135] [2024-11-07 05:46:39,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:46:39,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:46:39,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:46:39,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:46:39,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:46:39,432 INFO L87 Difference]: Start difference. First operand 807 states and 1160 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:39,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:46:39,541 INFO L93 Difference]: Finished difference Result 1356 states and 1955 transitions. [2024-11-07 05:46:39,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:46:39,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-07 05:46:39,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:46:39,545 INFO L225 Difference]: With dead ends: 1356 [2024-11-07 05:46:39,545 INFO L226 Difference]: Without dead ends: 809 [2024-11-07 05:46:39,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 05:46:39,547 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 130 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:46:39,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 243 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:46:39,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-11-07 05:46:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 805. [2024-11-07 05:46:39,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 637 states have (on average 1.3861852433281006) internal successors, (883), 641 states have internal predecessors, (883), 134 states have call successors, (134), 33 states have call predecessors, (134), 33 states have return successors, (134), 130 states have call predecessors, (134), 134 states have call successors, (134) [2024-11-07 05:46:39,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1151 transitions. [2024-11-07 05:46:39,615 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1151 transitions. Word has length 130 [2024-11-07 05:46:39,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:46:39,616 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1151 transitions. [2024-11-07 05:46:39,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1151 transitions. [2024-11-07 05:46:39,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 05:46:39,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:39,617 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:39,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 05:46:39,617 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:39,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:39,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1355590315, now seen corresponding path program 1 times [2024-11-07 05:46:39,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:46:39,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921240514] [2024-11-07 05:46:39,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:39,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:46:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:46:39,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1059298097] [2024-11-07 05:46:39,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:39,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:46:39,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:46:39,673 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:46:39,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 05:46:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:39,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 05:46:39,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:46:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-07 05:46:40,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:46:41,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:46:41,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921240514] [2024-11-07 05:46:41,178 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 05:46:41,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059298097] [2024-11-07 05:46:41,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059298097] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:46:41,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 05:46:41,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-07 05:46:41,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882480799] [2024-11-07 05:46:41,178 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 05:46:41,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 05:46:41,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:46:41,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 05:46:41,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-11-07 05:46:41,179 INFO L87 Difference]: Start difference. First operand 805 states and 1151 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 05:46:42,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:46:42,049 INFO L93 Difference]: Finished difference Result 1900 states and 2735 transitions. [2024-11-07 05:46:42,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 05:46:42,050 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2024-11-07 05:46:42,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:46:42,054 INFO L225 Difference]: With dead ends: 1900 [2024-11-07 05:46:42,055 INFO L226 Difference]: Without dead ends: 1163 [2024-11-07 05:46:42,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=466, Unknown=1, NotChecked=0, Total=650 [2024-11-07 05:46:42,057 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 144 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 49 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 05:46:42,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 828 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 762 Invalid, 14 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 05:46:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2024-11-07 05:46:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 935. [2024-11-07 05:46:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 723 states have (on average 1.3651452282157677) internal successors, (987), 727 states have internal predecessors, (987), 170 states have call successors, (170), 41 states have call predecessors, (170), 41 states have return successors, (170), 166 states have call predecessors, (170), 170 states have call successors, (170) [2024-11-07 05:46:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1327 transitions. [2024-11-07 05:46:42,117 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1327 transitions. Word has length 130 [2024-11-07 05:46:42,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:46:42,118 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1327 transitions. [2024-11-07 05:46:42,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 05:46:42,118 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1327 transitions. [2024-11-07 05:46:42,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 05:46:42,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:42,119 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:42,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 05:46:42,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:46:42,319 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:42,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:42,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1860750616, now seen corresponding path program 1 times [2024-11-07 05:46:42,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:46:42,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618484142] [2024-11-07 05:46:42,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:42,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:46:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:46:42,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1171997798] [2024-11-07 05:46:42,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:42,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:46:42,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:46:42,387 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:46:42,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 05:46:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:42,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 05:46:42,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:46:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 170 proven. 111 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-11-07 05:46:43,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:46:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 05:46:43,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:46:43,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618484142] [2024-11-07 05:46:43,763 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 05:46:43,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171997798] [2024-11-07 05:46:43,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171997798] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 05:46:43,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 05:46:43,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2024-11-07 05:46:43,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835236166] [2024-11-07 05:46:43,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:46:43,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 05:46:43,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:46:43,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 05:46:43,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-07 05:46:43,764 INFO L87 Difference]: Start difference. First operand 935 states and 1327 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:44,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:46:44,566 INFO L93 Difference]: Finished difference Result 1730 states and 2402 transitions. [2024-11-07 05:46:44,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 05:46:44,567 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2024-11-07 05:46:44,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:46:44,574 INFO L225 Difference]: With dead ends: 1730 [2024-11-07 05:46:44,574 INFO L226 Difference]: Without dead ends: 1463 [2024-11-07 05:46:44,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-11-07 05:46:44,577 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 424 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 05:46:44,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 410 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 05:46:44,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2024-11-07 05:46:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1030. [2024-11-07 05:46:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 806 states have (on average 1.3771712158808933) internal successors, (1110), 814 states have internal predecessors, (1110), 178 states have call successors, (178), 45 states have call predecessors, (178), 45 states have return successors, (178), 170 states have call predecessors, (178), 178 states have call successors, (178) [2024-11-07 05:46:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1466 transitions. [2024-11-07 05:46:44,679 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1466 transitions. Word has length 131 [2024-11-07 05:46:44,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:46:44,680 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1466 transitions. [2024-11-07 05:46:44,680 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:44,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1466 transitions. [2024-11-07 05:46:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 05:46:44,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:44,682 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:44,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 05:46:44,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 05:46:44,887 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:44,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:44,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1180692246, now seen corresponding path program 1 times [2024-11-07 05:46:44,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:46:44,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553261603] [2024-11-07 05:46:44,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:44,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:46:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:46:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:46:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:46:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:46:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:46:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:46:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:46:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:46:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:46:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 05:46:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 05:46:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:46:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:46:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:46:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 05:46:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:46:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 05:46:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:46:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:45,178 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 05:46:45,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:46:45,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553261603] [2024-11-07 05:46:45,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553261603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:46:45,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:46:45,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 05:46:45,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329138150] [2024-11-07 05:46:45,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:46:45,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:46:45,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:46:45,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:46:45,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:46:45,181 INFO L87 Difference]: Start difference. First operand 1030 states and 1466 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 05:46:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:46:45,548 INFO L93 Difference]: Finished difference Result 1441 states and 2055 transitions. [2024-11-07 05:46:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:46:45,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 131 [2024-11-07 05:46:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:46:45,554 INFO L225 Difference]: With dead ends: 1441 [2024-11-07 05:46:45,555 INFO L226 Difference]: Without dead ends: 1153 [2024-11-07 05:46:45,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-11-07 05:46:45,556 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 340 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:46:45,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 229 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:46:45,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-11-07 05:46:45,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1033. [2024-11-07 05:46:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 809 states have (on average 1.377008652657602) internal successors, (1114), 817 states have internal predecessors, (1114), 178 states have call successors, (178), 45 states have call predecessors, (178), 45 states have return successors, (178), 170 states have call predecessors, (178), 178 states have call successors, (178) [2024-11-07 05:46:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1470 transitions. [2024-11-07 05:46:45,656 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1470 transitions. Word has length 131 [2024-11-07 05:46:45,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:46:45,656 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1470 transitions. [2024-11-07 05:46:45,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 05:46:45,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1470 transitions. [2024-11-07 05:46:45,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 05:46:45,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:45,659 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:45,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 05:46:45,659 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:45,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:45,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1209558168, now seen corresponding path program 1 times [2024-11-07 05:46:45,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:46:45,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113727832] [2024-11-07 05:46:45,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:45,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:46:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:46:45,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2102986935] [2024-11-07 05:46:45,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:45,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:46:45,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:46:45,698 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:46:45,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 05:46:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:46:45,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 05:46:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:46:45,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 05:46:45,908 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 05:46:45,909 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 05:46:45,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-07 05:46:46,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-07 05:46:46,113 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:46:46,198 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 05:46:46,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:46:46 BoogieIcfgContainer [2024-11-07 05:46:46,205 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 05:46:46,205 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 05:46:46,209 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 05:46:46,209 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 05:46:46,210 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:46:22" (3/4) ... [2024-11-07 05:46:46,212 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 05:46:46,212 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 05:46:46,213 INFO L158 Benchmark]: Toolchain (without parser) took 24318.53ms. Allocated memory was 117.4MB in the beginning and 335.5MB in the end (delta: 218.1MB). Free memory was 91.5MB in the beginning and 224.3MB in the end (delta: -132.8MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. [2024-11-07 05:46:46,216 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:46:46,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.25ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 76.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 05:46:46,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.64ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 72.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:46:46,217 INFO L158 Benchmark]: Boogie Preprocessor took 61.61ms. Allocated memory is still 117.4MB. Free memory was 72.0MB in the beginning and 66.3MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 05:46:46,217 INFO L158 Benchmark]: RCFGBuilder took 451.27ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 86.2MB in the end (delta: -20.1MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-07 05:46:46,217 INFO L158 Benchmark]: TraceAbstraction took 23475.06ms. Allocated memory was 117.4MB in the beginning and 335.5MB in the end (delta: 218.1MB). Free memory was 85.8MB in the beginning and 224.4MB in the end (delta: -138.6MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. [2024-11-07 05:46:46,217 INFO L158 Benchmark]: Witness Printer took 6.80ms. Allocated memory is still 335.5MB. Free memory was 224.4MB in the beginning and 224.3MB in the end (delta: 86.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 05:46:46,218 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.23ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.25ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 76.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.64ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 72.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.61ms. Allocated memory is still 117.4MB. Free memory was 72.0MB in the beginning and 66.3MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 451.27ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 86.2MB in the end (delta: -20.1MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * TraceAbstraction took 23475.06ms. Allocated memory was 117.4MB in the beginning and 335.5MB in the end (delta: 218.1MB). Free memory was 85.8MB in the beginning and 224.4MB in the end (delta: -138.6MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. * Witness Printer took 6.80ms. Allocated memory is still 335.5MB. Free memory was 224.4MB in the beginning and 224.3MB in the end (delta: 86.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] float var_1_26 = 500.65; [L38] float var_1_30 = 9.8; [L39] unsigned char var_1_31 = 4; [L40] unsigned short int var_1_34 = 1; [L41] unsigned long int var_1_35 = 10; [L42] unsigned char var_1_36 = 10; [L43] unsigned char var_1_38 = 16; [L44] unsigned char var_1_39 = 0; [L45] unsigned short int var_1_40 = 10; [L46] unsigned short int var_1_41 = 128; [L47] unsigned short int var_1_42 = 40597; [L48] signed short int last_1_var_1_1 = 16; [L49] unsigned char last_1_var_1_6 = 10; [L50] unsigned char last_1_var_1_8 = 1; [L51] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L171] last_1_var_1_1 = var_1_1 [L172] last_1_var_1_6 = var_1_6 [L173] last_1_var_1_8 = var_1_8 [L174] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L184] RET updateLastVariables() [L185] CALL updateVariables() [L141] var_1_5 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L142] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L143] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L143] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L144] var_1_7 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L145] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L146] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L146] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L147] var_1_11 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L148] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L149] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L150] var_1_12 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L151] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L152] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L153] var_1_15 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L154] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L155] var_1_16 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L156] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L157] var_1_20 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L158] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L159] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L159] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L160] var_1_38 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L161] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L162] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L162] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L163] var_1_39 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L164] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L165] CALL assume_abort_if_not(var_1_39 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L165] RET assume_abort_if_not(var_1_39 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L166] var_1_42 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_42 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L167] RET assume_abort_if_not(var_1_42 >= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_42 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L168] RET assume_abort_if_not(var_1_42 <= 65534) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L185] RET updateVariables() [L186] CALL step() [L55] signed long int stepLocal_6 = last_1_var_1_1; [L56] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L57] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L58] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L61] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L66] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-258, var_1_8=1] [L69] COND TRUE var_1_5 >= -2 [L70] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=1] [L72] unsigned char stepLocal_4 = var_1_6; [L73] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=1] [L74] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=1] [L75] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L76] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=1] [L83] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=1] [L84] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=1] [L87] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=1] [L88] COND TRUE \read(var_1_19) [L89] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=1] [L95] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L96] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-258, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=1] [L97] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L104] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-258, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=0] [L106] COND TRUE var_1_11 || var_1_8 [L107] var_1_21 = ((var_1_7 > -4) || var_1_11) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-258, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=0] [L109] COND FALSE !(((var_1_1 + 25) % var_1_7) < 2) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-258, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=0] [L112] COND TRUE (- var_1_15) < ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16))) [L113] var_1_30 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-258, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=0] [L115] COND TRUE ((((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) < (var_1_5)) ? (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) : (var_1_5))) <= var_1_1 [L116] var_1_31 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-258, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-258, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=0] [L118] COND TRUE var_1_6 < ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) [L119] var_1_34 = ((((((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) > (var_1_7)) ? (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) : (var_1_7))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-258, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-258, var_1_34=254, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=0] [L121] COND TRUE \read(var_1_11) [L122] var_1_35 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-258, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-258, var_1_34=254, var_1_35=254, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=0] [L124] COND TRUE \read(var_1_11) [L125] var_1_36 = (var_1_7 - var_1_38) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-258, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-258, var_1_34=254, var_1_35=254, var_1_36=254, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=0] [L129] COND TRUE (- var_1_7) != var_1_6 [L130] var_1_40 = var_1_39 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-258, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-258, var_1_34=254, var_1_35=254, var_1_36=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=0] [L132] COND FALSE !(var_1_7 <= (~ var_1_7)) [L137] var_1_41 = var_1_6 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-258, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-258, var_1_34=254, var_1_35=254, var_1_36=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=154, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=0] [L186] RET step() [L187] CALL, EXPR property() [L177-L178] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-258, var_1_34=254, var_1_35=254, var_1_36=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=154, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=0] [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-258, var_1_34=254, var_1_35=254, var_1_36=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=154, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=2, var_1_31=-258, var_1_34=254, var_1_35=254, var_1_36=254, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=154, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-258, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.3s, OverallIterations: 13, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 3187 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3167 mSDsluCounter, 4547 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3198 mSDsCounter, 424 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3403 IncrementalHoareTripleChecker+Invalid, 3841 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 424 mSolverCounterUnsat, 1349 mSDtfsCounter, 3403 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1530 GetRequests, 1355 SyntacticMatches, 2 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1033occurred in iteration=12, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 1913 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 2343 NumberOfCodeBlocks, 2343 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2065 ConstructedInterpolants, 1 QuantifiedInterpolants, 10755 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1337 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 9408/9792 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 05:46:46,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.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 19a60273c9036fd322b397de31454eb141b9f154ab77bf61e90ba0f48087b2d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:46:48,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:46:48,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 05:46:48,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:46:48,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:46:48,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:46:48,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:46:48,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:46:48,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:46:48,391 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:46:48,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:46:48,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:46:48,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:46:48,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:46:48,392 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:46:48,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:46:48,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:46:48,393 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:46:48,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:46:48,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:46:48,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:46:48,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:46:48,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:46:48,393 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 05:46:48,393 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 05:46:48,393 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:46:48,393 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 05:46:48,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:46:48,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:46:48,394 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:46:48,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:46:48,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:46:48,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:46:48,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:46:48,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:46:48,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:46:48,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:46:48,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:46:48,395 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 05:46:48,395 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 05:46:48,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:46:48,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:46:48,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:46:48,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:46:48,395 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 -> 19a60273c9036fd322b397de31454eb141b9f154ab77bf61e90ba0f48087b2d9 [2024-11-07 05:46:48,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:46:48,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:46:48,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:46:48,740 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:46:48,740 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:46:48,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i [2024-11-07 05:46:50,219 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:46:50,460 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:46:50,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i [2024-11-07 05:46:50,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/238048eb3/72719128110044bd9b253eeb27f817cb/FLAG825e55303 [2024-11-07 05:46:50,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/238048eb3/72719128110044bd9b253eeb27f817cb [2024-11-07 05:46:50,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:46:50,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:46:50,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:46:50,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:46:50,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:46:50,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:46:50" (1/1) ... [2024-11-07 05:46:50,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@666b90b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:50, skipping insertion in model container [2024-11-07 05:46:50,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:46:50" (1/1) ... [2024-11-07 05:46:50,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:46:50,618 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i[919,932] [2024-11-07 05:46:50,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:46:50,695 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:46:50,704 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i[919,932] [2024-11-07 05:46:50,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:46:50,759 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:46:50,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:50 WrapperNode [2024-11-07 05:46:50,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:46:50,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:46:50,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:46:50,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:46:50,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:50" (1/1) ... [2024-11-07 05:46:50,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:50" (1/1) ... [2024-11-07 05:46:50,804 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-11-07 05:46:50,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:46:50,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:46:50,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:46:50,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:46:50,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:50" (1/1) ... [2024-11-07 05:46:50,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:50" (1/1) ... [2024-11-07 05:46:50,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:50" (1/1) ... [2024-11-07 05:46:50,836 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 05:46:50,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:50" (1/1) ... [2024-11-07 05:46:50,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:50" (1/1) ... [2024-11-07 05:46:50,846 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:50" (1/1) ... [2024-11-07 05:46:50,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:50" (1/1) ... [2024-11-07 05:46:50,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:50" (1/1) ... [2024-11-07 05:46:50,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:50" (1/1) ... [2024-11-07 05:46:50,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:46:50,863 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:46:50,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:46:50,863 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:46:50,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:50" (1/1) ... [2024-11-07 05:46:50,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:46:50,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:46:50,898 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 05:46:50,900 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 05:46:50,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:46:50,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 05:46:50,916 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:46:50,916 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:46:50,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:46:50,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:46:50,978 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:46:50,980 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:46:51,373 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-07 05:46:51,374 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:46:51,381 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:46:51,383 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:46:51,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:46:51 BoogieIcfgContainer [2024-11-07 05:46:51,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:46:51,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:46:51,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:46:51,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:46:51,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:46:50" (1/3) ... [2024-11-07 05:46:51,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432495b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:46:51, skipping insertion in model container [2024-11-07 05:46:51,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:46:50" (2/3) ... [2024-11-07 05:46:51,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432495b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:46:51, skipping insertion in model container [2024-11-07 05:46:51,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:46:51" (3/3) ... [2024-11-07 05:46:51,391 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-42.i [2024-11-07 05:46:51,401 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:46:51,401 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:46:51,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:46:51,464 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;@222f47ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:46:51,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:46:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 05:46:51,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 05:46:51,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:51,482 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:51,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:51,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:51,487 INFO L85 PathProgramCache]: Analyzing trace with hash 293078757, now seen corresponding path program 1 times [2024-11-07 05:46:51,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:46:51,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830138230] [2024-11-07 05:46:51,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:51,500 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 05:46:51,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:46:51,505 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 05:46:51,508 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 05:46:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:51,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 05:46:51,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:46:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-07 05:46:51,796 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:46:51,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:46:51,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830138230] [2024-11-07 05:46:51,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830138230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:46:51,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:46:51,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:46:51,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812781145] [2024-11-07 05:46:51,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:46:51,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:46:51,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:46:51,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:46:51,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:46:51,814 INFO L87 Difference]: Start difference. First operand has 72 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 05:46:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:46:51,829 INFO L93 Difference]: Finished difference Result 136 states and 236 transitions. [2024-11-07 05:46:51,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:46:51,830 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2024-11-07 05:46:51,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:46:51,834 INFO L225 Difference]: With dead ends: 136 [2024-11-07 05:46:51,834 INFO L226 Difference]: Without dead ends: 67 [2024-11-07 05:46:51,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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 05:46:51,838 INFO L432 NwaCegarLoop]: 103 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, 103 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 05:46:51,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:46:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-07 05:46:51,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-07 05:46:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.425531914893617) internal successors, (67), 47 states have internal predecessors, (67), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 05:46:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2024-11-07 05:46:51,862 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 129 [2024-11-07 05:46:51,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:46:51,862 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2024-11-07 05:46:51,863 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 05:46:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2024-11-07 05:46:51,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 05:46:51,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:51,865 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:51,874 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 05:46:52,065 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 05:46:52,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:52,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:52,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2013606881, now seen corresponding path program 1 times [2024-11-07 05:46:52,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:46:52,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891257649] [2024-11-07 05:46:52,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:52,068 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 05:46:52,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:46:52,070 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 05:46:52,072 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 05:46:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:52,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 05:46:52,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:46:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 05:46:52,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:46:52,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:46:52,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891257649] [2024-11-07 05:46:52,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891257649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:46:52,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:46:52,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:46:52,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834969624] [2024-11-07 05:46:52,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:46:52,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:46:52,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:46:52,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:46:52,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:46:52,567 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:52,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:46:52,853 INFO L93 Difference]: Finished difference Result 196 states and 304 transitions. [2024-11-07 05:46:52,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:46:52,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-11-07 05:46:52,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:46:52,859 INFO L225 Difference]: With dead ends: 196 [2024-11-07 05:46:52,859 INFO L226 Difference]: Without dead ends: 132 [2024-11-07 05:46:52,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:46:52,860 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 87 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:46:52,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 289 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:46:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-07 05:46:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 102. [2024-11-07 05:46:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 05:46:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2024-11-07 05:46:52,877 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 129 [2024-11-07 05:46:52,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:46:52,878 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2024-11-07 05:46:52,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2024-11-07 05:46:52,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 05:46:52,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:52,879 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:52,890 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 05:46:53,083 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 05:46:53,084 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:53,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:53,085 INFO L85 PathProgramCache]: Analyzing trace with hash -105600659, now seen corresponding path program 1 times [2024-11-07 05:46:53,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:46:53,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430136464] [2024-11-07 05:46:53,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:53,087 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 05:46:53,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:46:53,089 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 05:46:53,091 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 05:46:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:53,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 05:46:53,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:46:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 05:46:53,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:46:53,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:46:53,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430136464] [2024-11-07 05:46:53,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430136464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:46:53,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:46:53,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:46:53,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722400407] [2024-11-07 05:46:53,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:46:53,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:46:53,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:46:53,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:46:53,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:46:53,851 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:46:55,085 INFO L93 Difference]: Finished difference Result 301 states and 473 transitions. [2024-11-07 05:46:55,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 05:46:55,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-07 05:46:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:46:55,092 INFO L225 Difference]: With dead ends: 301 [2024-11-07 05:46:55,092 INFO L226 Difference]: Without dead ends: 237 [2024-11-07 05:46:55,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:46:55,094 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 150 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:46:55,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 450 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 05:46:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-07 05:46:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 164. [2024-11-07 05:46:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 106 states have internal predecessors, (144), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 05:46:55,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 252 transitions. [2024-11-07 05:46:55,138 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 252 transitions. Word has length 130 [2024-11-07 05:46:55,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:46:55,139 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 252 transitions. [2024-11-07 05:46:55,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:55,139 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 252 transitions. [2024-11-07 05:46:55,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 05:46:55,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:55,141 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:55,150 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 05:46:55,341 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 05:46:55,342 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:55,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:55,344 INFO L85 PathProgramCache]: Analyzing trace with hash -239614165, now seen corresponding path program 1 times [2024-11-07 05:46:55,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:46:55,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655198902] [2024-11-07 05:46:55,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:55,345 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 05:46:55,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:46:55,349 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 05:46:55,350 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 05:46:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:55,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 05:46:55,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:46:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 05:46:55,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:46:55,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:46:55,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655198902] [2024-11-07 05:46:55,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655198902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:46:55,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:46:55,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:46:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161529902] [2024-11-07 05:46:55,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:46:55,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:46:55,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:46:55,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:46:55,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:46:55,610 INFO L87 Difference]: Start difference. First operand 164 states and 252 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:55,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:46:55,747 INFO L93 Difference]: Finished difference Result 290 states and 449 transitions. [2024-11-07 05:46:55,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:46:55,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-07 05:46:55,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:46:55,754 INFO L225 Difference]: With dead ends: 290 [2024-11-07 05:46:55,754 INFO L226 Difference]: Without dead ends: 164 [2024-11-07 05:46:55,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 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 05:46:55,755 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:46:55,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:46:55,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-07 05:46:55,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-07 05:46:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 05:46:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 250 transitions. [2024-11-07 05:46:55,771 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 250 transitions. Word has length 130 [2024-11-07 05:46:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:46:55,772 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 250 transitions. [2024-11-07 05:46:55,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:46:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 250 transitions. [2024-11-07 05:46:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 05:46:55,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:55,773 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:55,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 05:46:55,974 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 05:46:55,974 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:55,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:55,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2061208425, now seen corresponding path program 1 times [2024-11-07 05:46:55,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:46:55,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185828761] [2024-11-07 05:46:55,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:55,976 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 05:46:55,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:46:55,978 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 05:46:55,980 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 05:46:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:56,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 05:46:56,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:46:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 45 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-07 05:46:56,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:46:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 48 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-07 05:46:56,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:46:56,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185828761] [2024-11-07 05:46:56,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1185828761] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:46:56,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:46:56,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-07 05:46:56,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516101572] [2024-11-07 05:46:56,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:46:56,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 05:46:56,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:46:56,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 05:46:56,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-07 05:46:56,685 INFO L87 Difference]: Start difference. First operand 164 states and 250 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-07 05:46:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:46:57,537 INFO L93 Difference]: Finished difference Result 357 states and 509 transitions. [2024-11-07 05:46:57,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 05:46:57,538 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 130 [2024-11-07 05:46:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:46:57,540 INFO L225 Difference]: With dead ends: 357 [2024-11-07 05:46:57,540 INFO L226 Difference]: Without dead ends: 293 [2024-11-07 05:46:57,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 05:46:57,541 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 138 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 05:46:57,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 516 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 05:46:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-07 05:46:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 267. [2024-11-07 05:46:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 182 states have (on average 1.3131868131868132) internal successors, (239), 182 states have internal predecessors, (239), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-07 05:46:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 383 transitions. [2024-11-07 05:46:57,576 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 383 transitions. Word has length 130 [2024-11-07 05:46:57,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:46:57,577 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 383 transitions. [2024-11-07 05:46:57,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-07 05:46:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 383 transitions. [2024-11-07 05:46:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 05:46:57,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:46:57,578 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:46:57,589 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 05:46:57,779 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 05:46:57,779 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:46:57,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:46:57,780 INFO L85 PathProgramCache]: Analyzing trace with hash 255770091, now seen corresponding path program 1 times [2024-11-07 05:46:57,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:46:57,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283323750] [2024-11-07 05:46:57,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:57,780 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 05:46:57,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:46:57,784 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 05:46:57,786 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 05:46:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:57,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 05:46:57,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:46:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-07 05:46:58,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:46:58,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:46:58,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283323750] [2024-11-07 05:46:58,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283323750] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:46:58,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [425662724] [2024-11-07 05:46:58,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:46:58,306 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 05:46:58,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 05:46:58,308 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 05:46:58,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-07 05:46:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:46:58,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 05:46:58,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:46:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 05:46:59,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:46:59,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [425662724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:46:59,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 05:46:59,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-07 05:46:59,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379625394] [2024-11-07 05:46:59,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:46:59,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 05:46:59,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:46:59,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 05:46:59,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 05:46:59,278 INFO L87 Difference]: Start difference. First operand 267 states and 383 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:47:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:01,183 INFO L93 Difference]: Finished difference Result 802 states and 1166 transitions. [2024-11-07 05:47:01,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 05:47:01,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-07 05:47:01,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:01,192 INFO L225 Difference]: With dead ends: 802 [2024-11-07 05:47:01,192 INFO L226 Difference]: Without dead ends: 661 [2024-11-07 05:47:01,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-07 05:47:01,195 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 187 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 05:47:01,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 479 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 05:47:01,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-07 05:47:01,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 574. [2024-11-07 05:47:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 420 states have (on average 1.3666666666666667) internal successors, (574), 422 states have internal predecessors, (574), 130 states have call successors, (130), 23 states have call predecessors, (130), 23 states have return successors, (130), 128 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-07 05:47:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 834 transitions. [2024-11-07 05:47:01,243 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 834 transitions. Word has length 130 [2024-11-07 05:47:01,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:01,243 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 834 transitions. [2024-11-07 05:47:01,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:47:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 834 transitions. [2024-11-07 05:47:01,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 05:47:01,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:01,260 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:01,269 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 (7)] Forceful destruction successful, exit code 0 [2024-11-07 05:47:01,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-07 05:47:01,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 05:47:01,665 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:01,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:01,666 INFO L85 PathProgramCache]: Analyzing trace with hash 474624809, now seen corresponding path program 1 times [2024-11-07 05:47:01,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:47:01,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306459375] [2024-11-07 05:47:01,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:01,667 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 05:47:01,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:47:01,668 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:47:01,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 05:47:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:01,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 05:47:01,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:47:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 05:47:02,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:47:02,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:47:02,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306459375] [2024-11-07 05:47:02,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306459375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:47:02,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:47:02,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:47:02,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066296650] [2024-11-07 05:47:02,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:47:02,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:47:02,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:47:02,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:47:02,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:47:02,091 INFO L87 Difference]: Start difference. First operand 574 states and 834 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:47:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:02,440 INFO L93 Difference]: Finished difference Result 1513 states and 2209 transitions. [2024-11-07 05:47:02,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:47:02,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-07 05:47:02,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:02,448 INFO L225 Difference]: With dead ends: 1513 [2024-11-07 05:47:02,448 INFO L226 Difference]: Without dead ends: 1069 [2024-11-07 05:47:02,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:47:02,450 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 148 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:47:02,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 280 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 05:47:02,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2024-11-07 05:47:02,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 894. [2024-11-07 05:47:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 656 states have (on average 1.3719512195121952) internal successors, (900), 658 states have internal predecessors, (900), 202 states have call successors, (202), 35 states have call predecessors, (202), 35 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2024-11-07 05:47:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1304 transitions. [2024-11-07 05:47:02,527 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1304 transitions. Word has length 130 [2024-11-07 05:47:02,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:02,527 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1304 transitions. [2024-11-07 05:47:02,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:47:02,528 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1304 transitions. [2024-11-07 05:47:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 05:47:02,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:02,529 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:02,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 05:47:02,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:47:02,732 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:02,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:02,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1097424877, now seen corresponding path program 1 times [2024-11-07 05:47:02,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:47:02,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283547427] [2024-11-07 05:47:02,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:02,733 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 05:47:02,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:47:02,739 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:47:02,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 05:47:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:02,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 05:47:02,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:47:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-07 05:47:03,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:47:03,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:47:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283547427] [2024-11-07 05:47:03,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283547427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:47:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1536854528] [2024-11-07 05:47:03,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:03,840 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 05:47:03,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 05:47:03,843 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 05:47:03,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-07 05:47:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:04,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 05:47:04,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:47:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 05:47:05,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:47:05,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1536854528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:47:05,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 05:47:05,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-07 05:47:05,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250884513] [2024-11-07 05:47:05,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:47:05,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:47:05,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:47:05,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:47:05,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-07 05:47:05,160 INFO L87 Difference]: Start difference. First operand 894 states and 1304 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:47:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:06,657 INFO L93 Difference]: Finished difference Result 1793 states and 2622 transitions. [2024-11-07 05:47:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 05:47:06,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-07 05:47:06,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:06,664 INFO L225 Difference]: With dead ends: 1793 [2024-11-07 05:47:06,664 INFO L226 Difference]: Without dead ends: 959 [2024-11-07 05:47:06,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-07 05:47:06,667 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 100 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:47:06,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 444 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 05:47:06,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-11-07 05:47:06,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 890. [2024-11-07 05:47:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 652 states have (on average 1.361963190184049) internal successors, (888), 654 states have internal predecessors, (888), 202 states have call successors, (202), 35 states have call predecessors, (202), 35 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2024-11-07 05:47:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1292 transitions. [2024-11-07 05:47:06,732 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1292 transitions. Word has length 130 [2024-11-07 05:47:06,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:06,733 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1292 transitions. [2024-11-07 05:47:06,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 05:47:06,733 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1292 transitions. [2024-11-07 05:47:06,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 05:47:06,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:06,734 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:06,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-11-07 05:47:06,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-07 05:47:07,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:47:07,136 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:07,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:07,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1467723606, now seen corresponding path program 1 times [2024-11-07 05:47:07,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:47:07,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942536369] [2024-11-07 05:47:07,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:07,137 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 05:47:07,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:47:07,139 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:47:07,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-07 05:47:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:07,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 05:47:07,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:47:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-07 05:47:07,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:47:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-07 05:47:09,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:47:09,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942536369] [2024-11-07 05:47:09,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942536369] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:47:09,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:47:09,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-07 05:47:09,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922685341] [2024-11-07 05:47:09,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:47:09,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 05:47:09,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:47:09,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 05:47:09,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-07 05:47:09,711 INFO L87 Difference]: Start difference. First operand 890 states and 1292 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2024-11-07 05:47:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:47:16,511 INFO L93 Difference]: Finished difference Result 1742 states and 2432 transitions. [2024-11-07 05:47:16,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 05:47:16,511 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 131 [2024-11-07 05:47:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:47:16,517 INFO L225 Difference]: With dead ends: 1742 [2024-11-07 05:47:16,517 INFO L226 Difference]: Without dead ends: 1368 [2024-11-07 05:47:16,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=356, Invalid=766, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 05:47:16,519 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 238 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-07 05:47:16,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 369 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-07 05:47:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2024-11-07 05:47:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1093. [2024-11-07 05:47:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 819 states have (on average 1.3357753357753357) internal successors, (1094), 829 states have internal predecessors, (1094), 218 states have call successors, (218), 55 states have call predecessors, (218), 55 states have return successors, (218), 208 states have call predecessors, (218), 218 states have call successors, (218) [2024-11-07 05:47:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1530 transitions. [2024-11-07 05:47:16,597 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1530 transitions. Word has length 131 [2024-11-07 05:47:16,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:47:16,597 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1530 transitions. [2024-11-07 05:47:16,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2024-11-07 05:47:16,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1530 transitions. [2024-11-07 05:47:16,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 05:47:16,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:47:16,602 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:16,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-07 05:47:16,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:47:16,806 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:47:16,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:47:16,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1209558168, now seen corresponding path program 1 times [2024-11-07 05:47:16,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:47:16,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193345669] [2024-11-07 05:47:16,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:47:16,807 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 05:47:16,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:47:16,809 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:47:16,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-07 05:47:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:47:17,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 05:47:17,087 INFO L278 TraceCheckSpWp]: Computing forward predicates...