./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.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-9.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', '965493649683322c4c4531e65d7189f027c727871d6e00cfa208433dbe39feba'] 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-9.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 965493649683322c4c4531e65d7189f027c727871d6e00cfa208433dbe39feba --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:51:58,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:51:59,057 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:51:59,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:51:59,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:51:59,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:51:59,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:51:59,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:51:59,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:51:59,094 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:51:59,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:51:59,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:51:59,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:51:59,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:51:59,096 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:51:59,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:51:59,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:51:59,097 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:51:59,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:51:59,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:51:59,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:51:59,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:51:59,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:51:59,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:51:59,098 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:51:59,098 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:51:59,098 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:51:59,098 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:51:59,098 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:51:59,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:51:59,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:51:59,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:51:59,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:51:59,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:51:59,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:51:59,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:51:59,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:51:59,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:51:59,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:51:59,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:51:59,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:51:59,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:51:59,099 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 -> 965493649683322c4c4531e65d7189f027c727871d6e00cfa208433dbe39feba [2024-11-07 05:51:59,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:51:59,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:51:59,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:51:59,407 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:51:59,407 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:51:59,408 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-9.i [2024-11-07 05:52:00,731 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:52:01,047 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:52:01,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i [2024-11-07 05:52:01,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c68673b73/08e550a6c56b42909bf8da75cc4337ea/FLAG1560f2c75 [2024-11-07 05:52:01,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c68673b73/08e550a6c56b42909bf8da75cc4337ea [2024-11-07 05:52:01,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:52:01,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:52:01,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:52:01,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:52:01,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:52:01,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:52:01" (1/1) ... [2024-11-07 05:52:01,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a0e2d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:01, skipping insertion in model container [2024-11-07 05:52:01,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:52:01" (1/1) ... [2024-11-07 05:52:01,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:52:01,278 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-9.i[918,931] [2024-11-07 05:52:01,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:52:01,383 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:52:01,394 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-9.i[918,931] [2024-11-07 05:52:01,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:52:01,451 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:52:01,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:01 WrapperNode [2024-11-07 05:52:01,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:52:01,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:52:01,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:52:01,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:52:01,460 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:52:01" (1/1) ... [2024-11-07 05:52:01,475 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:52:01" (1/1) ... [2024-11-07 05:52:01,527 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-11-07 05:52:01,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:52:01,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:52:01,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:52:01,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:52:01,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:01" (1/1) ... [2024-11-07 05:52:01,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:01" (1/1) ... [2024-11-07 05:52:01,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:01" (1/1) ... [2024-11-07 05:52:01,577 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:52:01,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:01" (1/1) ... [2024-11-07 05:52:01,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:01" (1/1) ... [2024-11-07 05:52:01,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:01" (1/1) ... [2024-11-07 05:52:01,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:01" (1/1) ... [2024-11-07 05:52:01,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:01" (1/1) ... [2024-11-07 05:52:01,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:01" (1/1) ... [2024-11-07 05:52:01,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:52:01,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:52:01,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:52:01,610 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:52:01,611 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:01" (1/1) ... [2024-11-07 05:52:01,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:52:01,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:52:01,646 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:52:01,654 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:52:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:52:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:52:01,674 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:52:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:52:01,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:52:01,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:52:01,773 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:52:01,775 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:52:02,418 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-07 05:52:02,418 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:52:02,433 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:52:02,435 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:52:02,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:52:02 BoogieIcfgContainer [2024-11-07 05:52:02,436 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:52:02,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:52:02,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:52:02,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:52:02,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:52:01" (1/3) ... [2024-11-07 05:52:02,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1f8863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:52:02, skipping insertion in model container [2024-11-07 05:52:02,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:01" (2/3) ... [2024-11-07 05:52:02,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d1f8863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:52:02, skipping insertion in model container [2024-11-07 05:52:02,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:52:02" (3/3) ... [2024-11-07 05:52:02,449 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i [2024-11-07 05:52:02,465 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:52:02,465 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:52:02,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:52:02,524 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;@4bd36c65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:52:02,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:52:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 05:52:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 05:52:02,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:02,551 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:02,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:02,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:02,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1440951997, now seen corresponding path program 1 times [2024-11-07 05:52:02,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:02,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198517870] [2024-11-07 05:52:02,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:02,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:52:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:52:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:52:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:52:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:52:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:52:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:52:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:52:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:52:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:52:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:52:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:02,995 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 05:52:02,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:02,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198517870] [2024-11-07 05:52:03,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198517870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:03,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:03,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:52:03,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061033234] [2024-11-07 05:52:03,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:03,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:52:03,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:03,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:52:03,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:52:03,029 INFO L87 Difference]: Start difference. First operand has 97 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 05:52:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:03,073 INFO L93 Difference]: Finished difference Result 187 states and 315 transitions. [2024-11-07 05:52:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:52:03,075 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 137 [2024-11-07 05:52:03,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:03,083 INFO L225 Difference]: With dead ends: 187 [2024-11-07 05:52:03,084 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 05:52:03,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:52:03,093 INFO L432 NwaCegarLoop]: 143 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, 143 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:52:03,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:52:03,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 05:52:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-07 05:52:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 72 states have internal predecessors, (105), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 05:52:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2024-11-07 05:52:03,133 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 137 [2024-11-07 05:52:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:03,134 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2024-11-07 05:52:03,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 05:52:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2024-11-07 05:52:03,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 05:52:03,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:03,140 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:03,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:52:03,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:03,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:03,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2040206659, now seen corresponding path program 1 times [2024-11-07 05:52:03,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:03,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750729734] [2024-11-07 05:52:03,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:03,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:52:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:52:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:52:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:52:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:52:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:52:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:52:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:52:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:52:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:52:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:52:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 05:52:03,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:03,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750729734] [2024-11-07 05:52:03,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750729734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:03,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:03,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:52:03,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322968085] [2024-11-07 05:52:03,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:03,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:52:03,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:03,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:52:03,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:52:03,518 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:03,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:03,562 INFO L93 Difference]: Finished difference Result 184 states and 285 transitions. [2024-11-07 05:52:03,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:52:03,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-07 05:52:03,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:03,565 INFO L225 Difference]: With dead ends: 184 [2024-11-07 05:52:03,565 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 05:52:03,566 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:52:03,567 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:03,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:52:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 05:52:03,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-07 05:52:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.452054794520548) internal successors, (106), 73 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 05:52:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 144 transitions. [2024-11-07 05:52:03,582 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 144 transitions. Word has length 137 [2024-11-07 05:52:03,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:03,588 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 144 transitions. [2024-11-07 05:52:03,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 144 transitions. [2024-11-07 05:52:03,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-07 05:52:03,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:03,590 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:03,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:52:03,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:03,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:03,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2063714094, now seen corresponding path program 1 times [2024-11-07 05:52:03,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:03,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779319612] [2024-11-07 05:52:03,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:03,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:52:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:52:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:52:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:52:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:52:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:52:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:52:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:52:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:52:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:52:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:52:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 05:52:03,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:03,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779319612] [2024-11-07 05:52:03,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779319612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:03,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:03,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:52:03,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008844149] [2024-11-07 05:52:03,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:03,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:52:03,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:03,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:52:03,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:52:03,870 INFO L87 Difference]: Start difference. First operand 94 states and 144 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:03,949 INFO L93 Difference]: Finished difference Result 253 states and 387 transitions. [2024-11-07 05:52:03,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:52:03,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-07 05:52:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:03,953 INFO L225 Difference]: With dead ends: 253 [2024-11-07 05:52:03,953 INFO L226 Difference]: Without dead ends: 162 [2024-11-07 05:52:03,954 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:52:03,959 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 99 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:03,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 293 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:52:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-07 05:52:03,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2024-11-07 05:52:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 125 states have internal predecessors, (176), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 05:52:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 240 transitions. [2024-11-07 05:52:03,991 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 240 transitions. Word has length 138 [2024-11-07 05:52:03,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:03,993 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 240 transitions. [2024-11-07 05:52:03,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:03,993 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 240 transitions. [2024-11-07 05:52:03,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-07 05:52:03,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:03,996 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:03,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:52:03,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:03,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:03,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1210184848, now seen corresponding path program 1 times [2024-11-07 05:52:03,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:03,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738992117] [2024-11-07 05:52:03,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:03,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:52:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:52:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:52:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:52:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:52:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:52:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:52:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:52:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:52:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:52:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:52:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:07,296 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 05:52:07,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:07,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738992117] [2024-11-07 05:52:07,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738992117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:07,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:07,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 05:52:07,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014271696] [2024-11-07 05:52:07,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:07,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:52:07,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:07,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:52:07,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:52:07,300 INFO L87 Difference]: Start difference. First operand 159 states and 240 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:09,083 INFO L93 Difference]: Finished difference Result 511 states and 774 transitions. [2024-11-07 05:52:09,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 05:52:09,084 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-07 05:52:09,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:09,090 INFO L225 Difference]: With dead ends: 511 [2024-11-07 05:52:09,090 INFO L226 Difference]: Without dead ends: 355 [2024-11-07 05:52:09,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 05:52:09,094 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 269 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:09,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 377 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 05:52:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-07 05:52:09,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 232. [2024-11-07 05:52:09,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 197 states have (on average 1.482233502538071) internal successors, (292), 198 states have internal predecessors, (292), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 05:52:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 356 transitions. [2024-11-07 05:52:09,125 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 356 transitions. Word has length 138 [2024-11-07 05:52:09,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:09,127 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 356 transitions. [2024-11-07 05:52:09,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 356 transitions. [2024-11-07 05:52:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-07 05:52:09,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:09,130 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:09,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 05:52:09,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:09,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:09,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1272224462, now seen corresponding path program 1 times [2024-11-07 05:52:09,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:09,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961932064] [2024-11-07 05:52:09,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:09,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:52:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:52:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:52:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:52:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:52:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:52:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:52:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:52:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:52:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:52:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:52:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 05:52:12,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:12,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961932064] [2024-11-07 05:52:12,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961932064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:12,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:12,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 05:52:12,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672483154] [2024-11-07 05:52:12,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:12,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 05:52:12,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:12,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 05:52:12,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-07 05:52:12,537 INFO L87 Difference]: Start difference. First operand 232 states and 356 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 05:52:15,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:15,702 INFO L93 Difference]: Finished difference Result 737 states and 1109 transitions. [2024-11-07 05:52:15,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 05:52:15,703 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 138 [2024-11-07 05:52:15,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:15,706 INFO L225 Difference]: With dead ends: 737 [2024-11-07 05:52:15,706 INFO L226 Difference]: Without dead ends: 508 [2024-11-07 05:52:15,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-07 05:52:15,709 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 797 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:15,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 499 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 05:52:15,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-07 05:52:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 297. [2024-11-07 05:52:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 260 states have (on average 1.5038461538461538) internal successors, (391), 261 states have internal predecessors, (391), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 05:52:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 455 transitions. [2024-11-07 05:52:15,745 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 455 transitions. Word has length 138 [2024-11-07 05:52:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:15,745 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 455 transitions. [2024-11-07 05:52:15,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 05:52:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 455 transitions. [2024-11-07 05:52:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-07 05:52:15,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:15,748 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:15,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 05:52:15,748 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:15,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:15,749 INFO L85 PathProgramCache]: Analyzing trace with hash -533213872, now seen corresponding path program 1 times [2024-11-07 05:52:15,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:15,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635423281] [2024-11-07 05:52:15,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:15,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:52:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:52:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:52:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:52:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:52:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:52:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:52:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:52:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:52:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:52:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:52:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 05:52:17,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:17,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635423281] [2024-11-07 05:52:17,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635423281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:17,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:17,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 05:52:17,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071852326] [2024-11-07 05:52:17,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:17,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:52:17,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:17,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:52:17,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:52:17,843 INFO L87 Difference]: Start difference. First operand 297 states and 455 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:19,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:19,097 INFO L93 Difference]: Finished difference Result 742 states and 1130 transitions. [2024-11-07 05:52:19,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 05:52:19,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-07 05:52:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:19,101 INFO L225 Difference]: With dead ends: 742 [2024-11-07 05:52:19,101 INFO L226 Difference]: Without dead ends: 448 [2024-11-07 05:52:19,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 05:52:19,103 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 213 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:19,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 567 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 05:52:19,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-07 05:52:19,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 240. [2024-11-07 05:52:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 203 states have (on average 1.4679802955665024) internal successors, (298), 204 states have internal predecessors, (298), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 05:52:19,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 362 transitions. [2024-11-07 05:52:19,122 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 362 transitions. Word has length 138 [2024-11-07 05:52:19,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:19,123 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 362 transitions. [2024-11-07 05:52:19,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 362 transitions. [2024-11-07 05:52:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-07 05:52:19,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:19,125 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:19,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 05:52:19,125 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:19,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:19,126 INFO L85 PathProgramCache]: Analyzing trace with hash 700711758, now seen corresponding path program 1 times [2024-11-07 05:52:19,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:19,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347090637] [2024-11-07 05:52:19,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:19,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:52:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:52:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:52:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:52:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:52:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:52:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:52:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:52:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:52:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:52:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:52:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 05:52:20,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:20,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347090637] [2024-11-07 05:52:20,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347090637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:20,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:20,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 05:52:20,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124014108] [2024-11-07 05:52:20,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:20,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 05:52:20,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:20,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 05:52:20,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-07 05:52:20,500 INFO L87 Difference]: Start difference. First operand 240 states and 362 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:21,023 INFO L93 Difference]: Finished difference Result 648 states and 985 transitions. [2024-11-07 05:52:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 05:52:21,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-07 05:52:21,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:21,028 INFO L225 Difference]: With dead ends: 648 [2024-11-07 05:52:21,029 INFO L226 Difference]: Without dead ends: 411 [2024-11-07 05:52:21,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 05:52:21,031 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 380 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:21,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 496 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 05:52:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-07 05:52:21,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 240. [2024-11-07 05:52:21,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 203 states have (on average 1.4679802955665024) internal successors, (298), 204 states have internal predecessors, (298), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 05:52:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 362 transitions. [2024-11-07 05:52:21,051 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 362 transitions. Word has length 138 [2024-11-07 05:52:21,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:21,052 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 362 transitions. [2024-11-07 05:52:21,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:21,052 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 362 transitions. [2024-11-07 05:52:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-07 05:52:21,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:21,056 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:21,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 05:52:21,057 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:21,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:21,057 INFO L85 PathProgramCache]: Analyzing trace with hash 762751372, now seen corresponding path program 1 times [2024-11-07 05:52:21,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:21,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894164416] [2024-11-07 05:52:21,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:21,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:52:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:52:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:52:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:52:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:52:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:52:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:52:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:52:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:52:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:52:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:52:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 05:52:22,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:22,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894164416] [2024-11-07 05:52:22,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894164416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:22,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:22,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 05:52:22,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725025597] [2024-11-07 05:52:22,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:22,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:52:22,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:22,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:52:22,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:52:22,230 INFO L87 Difference]: Start difference. First operand 240 states and 362 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:23,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:23,007 INFO L93 Difference]: Finished difference Result 581 states and 876 transitions. [2024-11-07 05:52:23,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 05:52:23,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-07 05:52:23,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:23,012 INFO L225 Difference]: With dead ends: 581 [2024-11-07 05:52:23,012 INFO L226 Difference]: Without dead ends: 344 [2024-11-07 05:52:23,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 05:52:23,015 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 213 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:23,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 523 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 05:52:23,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-07 05:52:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 171. [2024-11-07 05:52:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 134 states have (on average 1.3880597014925373) internal successors, (186), 135 states have internal predecessors, (186), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 05:52:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 250 transitions. [2024-11-07 05:52:23,039 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 250 transitions. Word has length 138 [2024-11-07 05:52:23,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:23,039 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 250 transitions. [2024-11-07 05:52:23,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:23,040 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 250 transitions. [2024-11-07 05:52:23,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 05:52:23,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:23,041 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:23,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 05:52:23,042 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:23,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:23,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1496949365, now seen corresponding path program 1 times [2024-11-07 05:52:23,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:23,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402173868] [2024-11-07 05:52:23,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:23,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:52:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:52:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:52:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:52:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:52:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:52:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:52:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:52:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:52:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:52:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:52:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,271 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-07 05:52:23,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:23,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402173868] [2024-11-07 05:52:23,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402173868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:52:23,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993371758] [2024-11-07 05:52:23,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:23,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:52:23,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:52:23,275 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:52:23,276 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:52:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:23,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 05:52:23,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:52:23,739 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 242 proven. 54 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-07 05:52:23,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:52:23,943 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-07 05:52:23,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993371758] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:52:23,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:52:23,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-07 05:52:23,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025580596] [2024-11-07 05:52:23,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:52:23,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 05:52:23,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:23,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 05:52:23,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-07 05:52:23,947 INFO L87 Difference]: Start difference. First operand 171 states and 250 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (56), 5 states have call predecessors, (56), 6 states have call successors, (56) [2024-11-07 05:52:24,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:24,182 INFO L93 Difference]: Finished difference Result 351 states and 507 transitions. [2024-11-07 05:52:24,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 05:52:24,183 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (56), 5 states have call predecessors, (56), 6 states have call successors, (56) Word has length 140 [2024-11-07 05:52:24,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:24,185 INFO L225 Difference]: With dead ends: 351 [2024-11-07 05:52:24,185 INFO L226 Difference]: Without dead ends: 183 [2024-11-07 05:52:24,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-07 05:52:24,189 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 421 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:24,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 224 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:52:24,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-07 05:52:24,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2024-11-07 05:52:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 140 states have (on average 1.3642857142857143) internal successors, (191), 141 states have internal predecessors, (191), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 05:52:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 255 transitions. [2024-11-07 05:52:24,206 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 255 transitions. Word has length 140 [2024-11-07 05:52:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:24,206 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 255 transitions. [2024-11-07 05:52:24,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (56), 5 states have call predecessors, (56), 6 states have call successors, (56) [2024-11-07 05:52:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 255 transitions. [2024-11-07 05:52:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 05:52:24,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:24,208 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:24,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 05:52:24,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:52:24,409 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:24,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:24,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1356400755, now seen corresponding path program 1 times [2024-11-07 05:52:24,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:24,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026492551] [2024-11-07 05:52:24,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:24,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:52:24,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [768012290] [2024-11-07 05:52:24,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:24,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:52:24,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:52:24,470 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:52:24,472 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:52:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:24,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 05:52:24,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:52:24,961 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 250 proven. 42 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-07 05:52:24,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:52:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-07 05:52:25,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:25,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026492551] [2024-11-07 05:52:25,227 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 05:52:25,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768012290] [2024-11-07 05:52:25,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768012290] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:52:25,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:52:25,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-07 05:52:25,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761061495] [2024-11-07 05:52:25,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:52:25,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 05:52:25,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:25,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 05:52:25,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-07 05:52:25,230 INFO L87 Difference]: Start difference. First operand 179 states and 255 transitions. Second operand has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 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:52:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:26,055 INFO L93 Difference]: Finished difference Result 587 states and 821 transitions. [2024-11-07 05:52:26,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 05:52:26,056 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 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 140 [2024-11-07 05:52:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:26,059 INFO L225 Difference]: With dead ends: 587 [2024-11-07 05:52:26,060 INFO L226 Difference]: Without dead ends: 411 [2024-11-07 05:52:26,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-07 05:52:26,061 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 502 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:26,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1071 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 05:52:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-07 05:52:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 309. [2024-11-07 05:52:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 268 states have (on average 1.4440298507462686) internal successors, (387), 269 states have internal predecessors, (387), 32 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 05:52:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 451 transitions. [2024-11-07 05:52:26,086 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 451 transitions. Word has length 140 [2024-11-07 05:52:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:26,087 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 451 transitions. [2024-11-07 05:52:26,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 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:52:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 451 transitions. [2024-11-07 05:52:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 05:52:26,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:26,090 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:26,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 05:52:26,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:52:26,295 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:26,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:26,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1493912682, now seen corresponding path program 1 times [2024-11-07 05:52:26,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:26,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636381609] [2024-11-07 05:52:26,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:26,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:52:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:52:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:52:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:52:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:52:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:52:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:52:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:52:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:52:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:52:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:52:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 05:52:26,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:26,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636381609] [2024-11-07 05:52:26,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636381609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:26,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:26,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:52:26,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376142244] [2024-11-07 05:52:26,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:26,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:52:26,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:26,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:52:26,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:52:26,382 INFO L87 Difference]: Start difference. First operand 309 states and 451 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:26,443 INFO L93 Difference]: Finished difference Result 714 states and 1025 transitions. [2024-11-07 05:52:26,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:52:26,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-11-07 05:52:26,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:26,447 INFO L225 Difference]: With dead ends: 714 [2024-11-07 05:52:26,447 INFO L226 Difference]: Without dead ends: 408 [2024-11-07 05:52:26,448 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:52:26,448 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 116 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:26,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 266 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:52:26,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-07 05:52:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 309. [2024-11-07 05:52:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 268 states have (on average 1.4365671641791045) internal successors, (385), 269 states have internal predecessors, (385), 32 states have call successors, (32), 8 states have call predecessors, (32), 8 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 05:52:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 449 transitions. [2024-11-07 05:52:26,472 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 449 transitions. Word has length 140 [2024-11-07 05:52:26,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:26,473 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 449 transitions. [2024-11-07 05:52:26,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 449 transitions. [2024-11-07 05:52:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 05:52:26,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:26,474 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:26,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 05:52:26,474 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:26,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:26,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1192147402, now seen corresponding path program 1 times [2024-11-07 05:52:26,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:26,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282598013] [2024-11-07 05:52:26,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:26,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:52:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:52:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:52:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:52:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:52:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:52:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:52:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:52:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:52:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:52:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:52:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 05:52:27,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:27,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282598013] [2024-11-07 05:52:27,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282598013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:27,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:27,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 05:52:27,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917787541] [2024-11-07 05:52:27,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:27,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 05:52:27,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:27,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 05:52:27,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 05:52:27,634 INFO L87 Difference]: Start difference. First operand 309 states and 449 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:28,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:28,985 INFO L93 Difference]: Finished difference Result 1341 states and 1905 transitions. [2024-11-07 05:52:28,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 05:52:28,986 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-11-07 05:52:28,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:28,993 INFO L225 Difference]: With dead ends: 1341 [2024-11-07 05:52:28,994 INFO L226 Difference]: Without dead ends: 1035 [2024-11-07 05:52:28,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-07 05:52:28,995 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 445 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:28,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1038 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 05:52:28,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2024-11-07 05:52:29,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 665. [2024-11-07 05:52:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 594 states have (on average 1.462962962962963) internal successors, (869), 597 states have internal predecessors, (869), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 05:52:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 977 transitions. [2024-11-07 05:52:29,046 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 977 transitions. Word has length 140 [2024-11-07 05:52:29,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:29,049 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 977 transitions. [2024-11-07 05:52:29,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:29,049 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 977 transitions. [2024-11-07 05:52:29,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 05:52:29,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:29,051 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:29,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 05:52:29,051 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:29,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:29,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1701620492, now seen corresponding path program 1 times [2024-11-07 05:52:29,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:29,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633545403] [2024-11-07 05:52:29,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:29,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:52:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:52:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:52:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:52:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:52:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:52:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:52:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:52:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:52:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:52:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:52:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 66 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2024-11-07 05:52:29,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:29,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633545403] [2024-11-07 05:52:29,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633545403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:52:29,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977294046] [2024-11-07 05:52:29,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:29,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:52:29,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:52:29,431 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:52:29,433 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:52:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 05:52:29,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:52:29,686 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 05:52:29,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:52:29,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977294046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:29,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 05:52:29,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-11-07 05:52:29,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265833801] [2024-11-07 05:52:29,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:29,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 05:52:29,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:29,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 05:52:29,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-07 05:52:29,690 INFO L87 Difference]: Start difference. First operand 665 states and 977 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:29,924 INFO L93 Difference]: Finished difference Result 1657 states and 2424 transitions. [2024-11-07 05:52:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 05:52:29,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-11-07 05:52:29,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:29,932 INFO L225 Difference]: With dead ends: 1657 [2024-11-07 05:52:29,932 INFO L226 Difference]: Without dead ends: 995 [2024-11-07 05:52:29,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-07 05:52:29,935 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 58 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:29,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 561 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:52:29,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2024-11-07 05:52:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 766. [2024-11-07 05:52:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 695 states have (on average 1.4892086330935252) internal successors, (1035), 698 states have internal predecessors, (1035), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 05:52:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1143 transitions. [2024-11-07 05:52:29,986 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1143 transitions. Word has length 140 [2024-11-07 05:52:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:29,986 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1143 transitions. [2024-11-07 05:52:29,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1143 transitions. [2024-11-07 05:52:29,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 05:52:29,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:29,990 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:30,009 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:52:30,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:52:30,195 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:30,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:30,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1846765901, now seen corresponding path program 1 times [2024-11-07 05:52:30,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:30,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412053504] [2024-11-07 05:52:30,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:30,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:52:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:52:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:52:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:52:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:52:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:52:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:52:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:52:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:52:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:52:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:52:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 05:52:32,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:32,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412053504] [2024-11-07 05:52:32,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412053504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:32,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:32,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 05:52:32,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959275058] [2024-11-07 05:52:32,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:32,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 05:52:32,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:32,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 05:52:32,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-07 05:52:32,703 INFO L87 Difference]: Start difference. First operand 766 states and 1143 transitions. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:36,068 INFO L93 Difference]: Finished difference Result 1751 states and 2593 transitions. [2024-11-07 05:52:36,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-07 05:52:36,069 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2024-11-07 05:52:36,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:36,075 INFO L225 Difference]: With dead ends: 1751 [2024-11-07 05:52:36,075 INFO L226 Difference]: Without dead ends: 976 [2024-11-07 05:52:36,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2024-11-07 05:52:36,077 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 690 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:36,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1034 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 05:52:36,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-07 05:52:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 886. [2024-11-07 05:52:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 815 states have (on average 1.4920245398773007) internal successors, (1216), 818 states have internal predecessors, (1216), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 05:52:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1324 transitions. [2024-11-07 05:52:36,127 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1324 transitions. Word has length 141 [2024-11-07 05:52:36,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:36,128 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1324 transitions. [2024-11-07 05:52:36,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:36,128 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1324 transitions. [2024-11-07 05:52:36,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 05:52:36,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:36,131 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:36,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 05:52:36,132 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:36,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash 264430818, now seen corresponding path program 1 times [2024-11-07 05:52:36,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:36,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665218602] [2024-11-07 05:52:36,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:36,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:52:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:52:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:52:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:52:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:52:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:52:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:52:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 05:52:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:52:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 05:52:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:52:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,223 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 05:52:36,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:36,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665218602] [2024-11-07 05:52:36,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665218602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:36,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:36,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:52:36,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504005135] [2024-11-07 05:52:36,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:36,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:52:36,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:36,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:52:36,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:52:36,225 INFO L87 Difference]: Start difference. First operand 886 states and 1324 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:36,316 INFO L93 Difference]: Finished difference Result 2024 states and 3027 transitions. [2024-11-07 05:52:36,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:52:36,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2024-11-07 05:52:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:36,322 INFO L225 Difference]: With dead ends: 2024 [2024-11-07 05:52:36,323 INFO L226 Difference]: Without dead ends: 1141 [2024-11-07 05:52:36,324 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:52:36,325 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 51 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:36,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 244 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:52:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2024-11-07 05:52:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 974. [2024-11-07 05:52:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 903 states have (on average 1.496124031007752) internal successors, (1351), 906 states have internal predecessors, (1351), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 05:52:36,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1459 transitions. [2024-11-07 05:52:36,377 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1459 transitions. Word has length 141 [2024-11-07 05:52:36,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:36,378 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1459 transitions. [2024-11-07 05:52:36,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 05:52:36,379 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1459 transitions. [2024-11-07 05:52:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 05:52:36,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:36,381 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:36,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 05:52:36,381 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:36,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:36,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1647627469, now seen corresponding path program 1 times [2024-11-07 05:52:36,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:36,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219665072] [2024-11-07 05:52:36,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:36,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:52:36,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1890344398] [2024-11-07 05:52:36,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:36,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:52:36,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:52:36,437 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:52:36,438 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:52:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:36,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 05:52:36,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:52:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 288 proven. 39 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-07 05:52:36,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:52:47,534 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~var_1_6~0 c_~var_1_6~0))) (and (forall ((v_z_31 Int)) (or (< .cse0 v_z_31) (= v_z_31 0) (< v_z_31 0) (< (div v_z_31 c_~var_1_6~0) v_z_31) (< 255 v_z_31))) (or (< c_~var_1_6~0 (+ (mod c_~last_1_var_1_12~0 65536) 1 c_~var_1_7~0)) (and (forall ((v_z_28 Int)) (or (< .cse0 v_z_28) (< v_z_28 0) (< (div v_z_28 c_~var_1_6~0) v_z_28))) (forall ((v_z_26 Int)) (or (< v_z_26 0) (< c_~var_1_6~0 (+ v_z_26 1)) (< (div v_z_26 c_~var_1_6~0) v_z_26))) (<= (+ 1 .cse0) c_~var_1_6~0))) (or (< .cse0 1) (< .cse0 c_~var_1_6~0)))) is different from false [2024-11-07 05:52:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-07 05:52:48,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:48,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219665072] [2024-11-07 05:52:48,511 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 05:52:48,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890344398] [2024-11-07 05:52:48,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890344398] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:52:48,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:52:48,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-07 05:52:48,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478981108] [2024-11-07 05:52:48,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:52:48,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 05:52:48,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:48,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 05:52:48,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=176, Unknown=2, NotChecked=28, Total=272 [2024-11-07 05:52:48,513 INFO L87 Difference]: Start difference. First operand 974 states and 1459 transitions. Second operand has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-07 05:52:54,213 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~last_1_var_1_12~0 65536)) (.cse1 (div c_~var_1_6~0 c_~var_1_6~0))) (and (<= c_~var_1_6~0 (+ .cse0 c_~var_1_7~0)) (forall ((v_z_31 Int)) (or (< .cse1 v_z_31) (= v_z_31 0) (< v_z_31 0) (< (div v_z_31 c_~var_1_6~0) v_z_31) (< 255 v_z_31))) (or (< c_~var_1_6~0 (+ .cse0 1 c_~var_1_7~0)) (and (forall ((v_z_28 Int)) (or (< .cse1 v_z_28) (< v_z_28 0) (< (div v_z_28 c_~var_1_6~0) v_z_28))) (forall ((v_z_26 Int)) (or (< v_z_26 0) (< c_~var_1_6~0 (+ v_z_26 1)) (< (div v_z_26 c_~var_1_6~0) v_z_26))) (<= (+ 1 .cse1) c_~var_1_6~0))) (or (< .cse1 1) (< .cse1 c_~var_1_6~0)) (<= 6 c_~var_1_6~0))) is different from false [2024-11-07 05:52:56,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:56,055 INFO L93 Difference]: Finished difference Result 2105 states and 3105 transitions. [2024-11-07 05:52:56,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 05:52:56,055 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 141 [2024-11-07 05:52:56,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:56,060 INFO L225 Difference]: With dead ends: 2105 [2024-11-07 05:52:56,060 INFO L226 Difference]: Without dead ends: 1113 [2024-11-07 05:52:56,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=139, Invalid=372, Unknown=3, NotChecked=86, Total=600 [2024-11-07 05:52:56,063 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 616 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 313 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:56,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 979 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 884 Invalid, 0 Unknown, 313 Unchecked, 3.1s Time] [2024-11-07 05:52:56,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-11-07 05:52:56,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1034. [2024-11-07 05:52:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 959 states have (on average 1.446298227320125) internal successors, (1387), 962 states have internal predecessors, (1387), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 05:52:56,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1495 transitions. [2024-11-07 05:52:56,119 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1495 transitions. Word has length 141 [2024-11-07 05:52:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:56,119 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1495 transitions. [2024-11-07 05:52:56,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-07 05:52:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1495 transitions. [2024-11-07 05:52:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 05:52:56,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:56,122 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:56,140 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:52:56,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-07 05:52:56,326 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:56,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:56,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1626271473, now seen corresponding path program 1 times [2024-11-07 05:52:56,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:56,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992991948] [2024-11-07 05:52:56,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:56,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:52:56,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [277960054] [2024-11-07 05:52:56,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:56,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:52:56,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:52:56,390 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:52:56,391 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:52:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:52:56,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 05:52:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:52:56,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 05:52:56,709 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 05:52:56,710 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 05:52:56,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 05:52:56,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 05:52:56,914 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:52:57,006 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 05:52:57,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:52:57 BoogieIcfgContainer [2024-11-07 05:52:57,011 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 05:52:57,012 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 05:52:57,012 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 05:52:57,012 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 05:52:57,013 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:52:02" (3/4) ... [2024-11-07 05:52:57,015 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 05:52:57,015 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 05:52:57,016 INFO L158 Benchmark]: Toolchain (without parser) took 55926.65ms. Allocated memory was 100.7MB in the beginning and 427.8MB in the end (delta: 327.2MB). Free memory was 76.9MB in the beginning and 199.5MB in the end (delta: -122.7MB). Peak memory consumption was 203.9MB. Max. memory is 16.1GB. [2024-11-07 05:52:57,016 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:52:57,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.03ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 62.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 05:52:57,017 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.23ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 58.7MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:52:57,017 INFO L158 Benchmark]: Boogie Preprocessor took 76.32ms. Allocated memory is still 100.7MB. Free memory was 58.7MB in the beginning and 55.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:52:57,017 INFO L158 Benchmark]: RCFGBuilder took 826.53ms. Allocated memory is still 100.7MB. Free memory was 55.4MB in the beginning and 66.8MB in the end (delta: -11.4MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-11-07 05:52:57,017 INFO L158 Benchmark]: TraceAbstraction took 54573.61ms. Allocated memory was 100.7MB in the beginning and 427.8MB in the end (delta: 327.2MB). Free memory was 66.3MB in the beginning and 199.6MB in the end (delta: -133.3MB). Peak memory consumption was 191.0MB. Max. memory is 16.1GB. [2024-11-07 05:52:57,017 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 427.8MB. Free memory was 199.6MB in the beginning and 199.5MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:52:57,019 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 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.03ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 62.0MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.23ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 58.7MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 76.32ms. Allocated memory is still 100.7MB. Free memory was 58.7MB in the beginning and 55.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 826.53ms. Allocated memory is still 100.7MB. Free memory was 55.4MB in the beginning and 66.8MB in the end (delta: -11.4MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * TraceAbstraction took 54573.61ms. Allocated memory was 100.7MB in the beginning and 427.8MB in the end (delta: 327.2MB). Free memory was 66.3MB in the beginning and 199.6MB in the end (delta: -133.3MB). Peak memory consumption was 191.0MB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 427.8MB. Free memory was 199.6MB in the beginning and 199.5MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 161, overapproximation of shiftLeft at line 169, overapproximation of someUnaryDOUBLEoperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 169. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_23 = 64; [L38] unsigned short int var_1_26 = 32; [L39] unsigned short int var_1_28 = 64; [L40] float var_1_30 = -0.2; [L41] float var_1_32 = -0.375; [L42] float var_1_33 = 1.4; [L43] float var_1_35 = 1.5; [L44] unsigned char last_1_var_1_10 = 32; [L45] unsigned short int last_1_var_1_12 = 16; [L46] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] CALL updateLastVariables() [L164] last_1_var_1_10 = var_1_10 [L165] last_1_var_1_12 = var_1_12 [L166] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L176] RET updateLastVariables() [L177] CALL updateVariables() [L133] var_1_3 = __VERIFIER_nondet_short() [L134] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L134] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L135] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L135] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L136] var_1_5 = __VERIFIER_nondet_long() [L137] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L137] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L138] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L138] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L139] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L139] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L140] var_1_6 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L141] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L142] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L142] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L143] var_1_7 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L144] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L145] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L145] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L146] var_1_8 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5] [L147] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5] [L148] var_1_9 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L149] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L150] var_1_11 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L151] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L152] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L152] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L153] var_1_15 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L154] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L155] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L155] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L156] var_1_30 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L157] RET assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L158] CALL assume_abort_if_not(var_1_30 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L158] RET assume_abort_if_not(var_1_30 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L159] var_1_32 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L160] RET assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L161] CALL assume_abort_if_not(var_1_32 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L161] RET assume_abort_if_not(var_1_32 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L177] RET updateVariables() [L178] CALL step() [L50] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L51] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=6, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L53] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=1, var_1_12=6, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L54] COND TRUE var_1_6 <= stepLocal_2 [L55] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L59] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L59] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L66] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L68] var_1_18 = var_1_3 [L69] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L70] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L71] COND FALSE !((- var_1_9) <= var_1_8) [L84] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L86] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L87] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L87] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L88] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L95] COND FALSE !(var_1_15 || var_1_15) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L98] COND FALSE !(((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) == (~ 16u)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L103] COND TRUE var_1_11 <= var_1_12 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L104] COND FALSE !(var_1_11 <= (((((var_1_11) < (var_1_6)) ? (var_1_11) : (var_1_6))) / var_1_6)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L118] COND FALSE !((var_1_9 / var_1_30) > ((((var_1_8 / var_1_32) < 0 ) ? -(var_1_8 / var_1_32) : (var_1_8 / var_1_32)))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L123] var_1_33 = var_1_8 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=2] [L124] COND FALSE !(((256 - var_1_11) <= (var_1_11 + var_1_10)) || var_1_15) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=2] [L178] RET step() [L179] CALL, EXPR property() [L169] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=2] [L169] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=2] [L169] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=2] [L169] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=2] [L169] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=2] [L169-L170] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.4s, OverallIterations: 17, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4881 SdHoareTripleChecker+Valid, 13.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4870 mSDsluCounter, 8594 SdHoareTripleChecker+Invalid, 12.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 313 IncrementalHoareTripleChecker+Unchecked, 6396 mSDsCounter, 193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6294 IncrementalHoareTripleChecker+Invalid, 6800 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 193 mSolverCounterUnsat, 2198 mSDtfsCounter, 6294 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1694 GetRequests, 1531 SyntacticMatches, 1 SemanticMatches, 162 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 20.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1034occurred in iteration=16, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 2029 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 29.1s InterpolantComputationTime, 3068 NumberOfCodeBlocks, 3068 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2905 ConstructedInterpolants, 14 QuantifiedInterpolants, 17335 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1341 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 13974/14364 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:52:57,229 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-07 05:52:57,284 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 137 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-9.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 965493649683322c4c4531e65d7189f027c727871d6e00cfa208433dbe39feba --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:52:59,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:52:59,374 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:52:59,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:52:59,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:52:59,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:52:59,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:52:59,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:52:59,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:52:59,429 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:52:59,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:52:59,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:52:59,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:52:59,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:52:59,431 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:52:59,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:52:59,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:52:59,432 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:52:59,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:52:59,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:52:59,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:52:59,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:52:59,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:52:59,433 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 05:52:59,433 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 05:52:59,433 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:52:59,433 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 05:52:59,433 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:52:59,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:52:59,434 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:52:59,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:52:59,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:52:59,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:52:59,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:52:59,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:52:59,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:52:59,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:52:59,434 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:52:59,434 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 05:52:59,434 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 05:52:59,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:52:59,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:52:59,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:52:59,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:52:59,435 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 -> 965493649683322c4c4531e65d7189f027c727871d6e00cfa208433dbe39feba [2024-11-07 05:52:59,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:52:59,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:52:59,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:52:59,786 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:52:59,786 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:52:59,787 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-9.i [2024-11-07 05:53:01,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:53:01,410 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:53:01,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i [2024-11-07 05:53:01,423 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f0292fa3/cfb76e19c34c44598ffd395b858b11f2/FLAGb8dbdf570 [2024-11-07 05:53:01,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f0292fa3/cfb76e19c34c44598ffd395b858b11f2 [2024-11-07 05:53:01,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:53:01,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:53:01,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:53:01,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:53:01,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:53:01,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:53:01" (1/1) ... [2024-11-07 05:53:01,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55742c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:53:01, skipping insertion in model container [2024-11-07 05:53:01,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:53:01" (1/1) ... [2024-11-07 05:53:01,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:53:01,622 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-9.i[918,931] [2024-11-07 05:53:01,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:53:01,727 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:53:01,740 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-9.i[918,931] [2024-11-07 05:53:01,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:53:01,805 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:53:01,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:53:01 WrapperNode [2024-11-07 05:53:01,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:53:01,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:53:01,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:53:01,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:53:01,814 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:53:01" (1/1) ... [2024-11-07 05:53:01,833 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:53:01" (1/1) ... [2024-11-07 05:53:01,867 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2024-11-07 05:53:01,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:53:01,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:53:01,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:53:01,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:53:01,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:53:01" (1/1) ... [2024-11-07 05:53:01,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:53:01" (1/1) ... [2024-11-07 05:53:01,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:53:01" (1/1) ... [2024-11-07 05:53:01,905 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:53:01,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:53:01" (1/1) ... [2024-11-07 05:53:01,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:53:01" (1/1) ... [2024-11-07 05:53:01,918 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:53:01" (1/1) ... [2024-11-07 05:53:01,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:53:01" (1/1) ... [2024-11-07 05:53:01,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:53:01" (1/1) ... [2024-11-07 05:53:01,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:53:01" (1/1) ... [2024-11-07 05:53:01,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:53:01,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:53:01,942 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:53:01,942 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:53:01,943 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:53:01" (1/1) ... [2024-11-07 05:53:01,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:53:01,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:53:01,981 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:53:01,985 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:53:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:53:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 05:53:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:53:02,009 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:53:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:53:02,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:53:02,105 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:53:02,108 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:53:12,416 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 05:53:12,416 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:53:12,429 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:53:12,429 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:53:12,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:53:12 BoogieIcfgContainer [2024-11-07 05:53:12,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:53:12,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:53:12,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:53:12,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:53:12,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:53:01" (1/3) ... [2024-11-07 05:53:12,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db527e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:53:12, skipping insertion in model container [2024-11-07 05:53:12,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:53:01" (2/3) ... [2024-11-07 05:53:12,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db527e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:53:12, skipping insertion in model container [2024-11-07 05:53:12,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:53:12" (3/3) ... [2024-11-07 05:53:12,440 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i [2024-11-07 05:53:12,456 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:53:12,456 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:53:12,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:53:12,534 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;@6373e5e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:53:12,534 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:53:12,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 53 states have internal predecessors, (79), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 05:53:12,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 05:53:12,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:53:12,553 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:12,554 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:53:12,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:53:12,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1663308198, now seen corresponding path program 1 times [2024-11-07 05:53:12,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:53:12,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466610030] [2024-11-07 05:53:12,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:53:12,575 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:53:12,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:53:12,580 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:53:12,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 05:53:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:14,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 05:53:14,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:53:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-07 05:53:14,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:53:14,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:53:14,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466610030] [2024-11-07 05:53:14,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466610030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:53:14,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:53:14,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:53:14,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745114392] [2024-11-07 05:53:14,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:53:14,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:53:14,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:53:14,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:53:14,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:53:14,324 INFO L87 Difference]: Start difference. First operand has 74 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 53 states have internal predecessors, (79), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 05:53:14,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:53:14,356 INFO L93 Difference]: Finished difference Result 140 states and 245 transitions. [2024-11-07 05:53:14,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:53:14,359 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 129 [2024-11-07 05:53:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:53:14,366 INFO L225 Difference]: With dead ends: 140 [2024-11-07 05:53:14,367 INFO L226 Difference]: Without dead ends: 69 [2024-11-07 05:53:14,370 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:53:14,372 INFO L432 NwaCegarLoop]: 106 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, 106 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:53:14,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:53:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-07 05:53:14,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-07 05:53:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 05:53:14,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 106 transitions. [2024-11-07 05:53:14,413 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 106 transitions. Word has length 129 [2024-11-07 05:53:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:53:14,414 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 106 transitions. [2024-11-07 05:53:14,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 05:53:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 106 transitions. [2024-11-07 05:53:14,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 05:53:14,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:53:14,418 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:14,478 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:53:14,619 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:53:14,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:53:14,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:53:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1369159468, now seen corresponding path program 1 times [2024-11-07 05:53:14,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:53:14,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586426424] [2024-11-07 05:53:14,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:53:14,621 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:53:14,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:53:14,623 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:53:14,625 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