./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --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/bitvector/soft_float_1-3a.c.cil.c', '-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', '2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f'] 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/bitvector/soft_float_1-3a.c.cil.c -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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:50:02,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:50:02,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 18:50:02,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:50:02,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:50:02,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:50:02,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:50:02,897 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:50:02,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:50:02,897 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:50:02,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:50:02,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:50:02,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:50:02,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:50:02,898 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:50:02,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:50:02,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:50:02,899 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:50:02,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:50:02,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:50:02,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:50:02,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:50:02,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:50:02,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:50:02,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:50:02,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:50:02,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:50:02,900 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:50:02,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:50:02,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:50:02,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:50:02,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:50:02,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:50:02,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:50:02,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:50:02,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:50:02,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:50:02,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:50:02,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:50:02,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:50:02,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:50:02,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:50:02,902 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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2024-11-06 18:50:03,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:50:03,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:50:03,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:50:03,207 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:50:03,207 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:50:03,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-11-06 18:50:04,603 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:50:04,830 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:50:04,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-11-06 18:50:04,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/845385631/eb71d0ab827a476784f2e43b72d7f12f/FLAG90febe574 [2024-11-06 18:50:04,860 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/845385631/eb71d0ab827a476784f2e43b72d7f12f [2024-11-06 18:50:04,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:50:04,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:50:04,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:50:04,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:50:04,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:50:04,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:50:04" (1/1) ... [2024-11-06 18:50:04,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b9544f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:04, skipping insertion in model container [2024-11-06 18:50:04,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:50:04" (1/1) ... [2024-11-06 18:50:04,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:50:05,029 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/bitvector/soft_float_1-3a.c.cil.c[730,743] [2024-11-06 18:50:05,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:50:05,105 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:50:05,113 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/bitvector/soft_float_1-3a.c.cil.c[730,743] [2024-11-06 18:50:05,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:50:05,173 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:50:05,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:05 WrapperNode [2024-11-06 18:50:05,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:50:05,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:50:05,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:50:05,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:50:05,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:05" (1/1) ... [2024-11-06 18:50:05,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:05" (1/1) ... [2024-11-06 18:50:05,224 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 189 [2024-11-06 18:50:05,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:50:05,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:50:05,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:50:05,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:50:05,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:05" (1/1) ... [2024-11-06 18:50:05,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:05" (1/1) ... [2024-11-06 18:50:05,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:05" (1/1) ... [2024-11-06 18:50:05,265 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-06 18:50:05,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:05" (1/1) ... [2024-11-06 18:50:05,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:05" (1/1) ... [2024-11-06 18:50:05,273 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:05" (1/1) ... [2024-11-06 18:50:05,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:05" (1/1) ... [2024-11-06 18:50:05,279 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:05" (1/1) ... [2024-11-06 18:50:05,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:05" (1/1) ... [2024-11-06 18:50:05,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:50:05,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:50:05,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:50:05,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:50:05,287 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:05" (1/1) ... [2024-11-06 18:50:05,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:50:05,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:05,326 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-06 18:50:05,331 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-06 18:50:05,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:50:05,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:50:05,354 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-06 18:50:05,354 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-06 18:50:05,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:50:05,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:50:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 18:50:05,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 18:50:05,439 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:50:05,441 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:50:05,959 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-06 18:50:05,959 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:50:05,970 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:50:05,971 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 18:50:05,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:50:05 BoogieIcfgContainer [2024-11-06 18:50:05,972 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:50:05,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:50:05,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:50:05,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:50:05,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:50:04" (1/3) ... [2024-11-06 18:50:05,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f86b378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:50:05, skipping insertion in model container [2024-11-06 18:50:05,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:05" (2/3) ... [2024-11-06 18:50:05,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f86b378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:50:05, skipping insertion in model container [2024-11-06 18:50:05,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:50:05" (3/3) ... [2024-11-06 18:50:05,983 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2024-11-06 18:50:05,997 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:50:05,998 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:50:06,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:50:06,069 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;@203852ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:50:06,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:50:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 86 states have internal predecessors, (131), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-06 18:50:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-06 18:50:06,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:06,087 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-06 18:50:06,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:06,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:06,094 INFO L85 PathProgramCache]: Analyzing trace with hash 766642651, now seen corresponding path program 1 times [2024-11-06 18:50:06,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:06,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073426293] [2024-11-06 18:50:06,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:06,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:06,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:06,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073426293] [2024-11-06 18:50:06,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073426293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:06,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:06,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 18:50:06,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788004693] [2024-11-06 18:50:06,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:06,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 18:50:06,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:06,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 18:50:06,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:06,782 INFO L87 Difference]: Start difference. First operand has 96 states, 83 states have (on average 1.5783132530120483) internal successors, (131), 86 states have internal predecessors, (131), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:07,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:07,009 INFO L93 Difference]: Finished difference Result 225 states and 366 transitions. [2024-11-06 18:50:07,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 18:50:07,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-06 18:50:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:07,025 INFO L225 Difference]: With dead ends: 225 [2024-11-06 18:50:07,026 INFO L226 Difference]: Without dead ends: 126 [2024-11-06 18:50:07,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:50:07,033 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 38 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:07,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 754 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:07,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-06 18:50:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-06 18:50:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 112 states have internal predecessors, (161), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-06 18:50:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 185 transitions. [2024-11-06 18:50:07,090 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 185 transitions. Word has length 36 [2024-11-06 18:50:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:07,092 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 185 transitions. [2024-11-06 18:50:07,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:07,093 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 185 transitions. [2024-11-06 18:50:07,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-06 18:50:07,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:07,097 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 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-06 18:50:07,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 18:50:07,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:07,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:07,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1140690581, now seen corresponding path program 1 times [2024-11-06 18:50:07,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:07,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266210310] [2024-11-06 18:50:07,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:07,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:07,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:07,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266210310] [2024-11-06 18:50:07,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266210310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:07,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:07,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:50:07,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629791094] [2024-11-06 18:50:07,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:07,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:50:07,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:07,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:50:07,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:50:07,210 INFO L87 Difference]: Start difference. First operand 124 states and 185 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:07,249 INFO L93 Difference]: Finished difference Result 212 states and 318 transitions. [2024-11-06 18:50:07,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:50:07,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-06 18:50:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:07,252 INFO L225 Difference]: With dead ends: 212 [2024-11-06 18:50:07,252 INFO L226 Difference]: Without dead ends: 170 [2024-11-06 18:50:07,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-06 18:50:07,253 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 40 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:07,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 291 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-06 18:50:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-11-06 18:50:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 155 states have internal predecessors, (219), 14 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-06 18:50:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 249 transitions. [2024-11-06 18:50:07,267 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 249 transitions. Word has length 37 [2024-11-06 18:50:07,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:07,267 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 249 transitions. [2024-11-06 18:50:07,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 249 transitions. [2024-11-06 18:50:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 18:50:07,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:07,269 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 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-06 18:50:07,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 18:50:07,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:07,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:07,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2070341150, now seen corresponding path program 1 times [2024-11-06 18:50:07,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:07,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792585829] [2024-11-06 18:50:07,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:07,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:07,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:07,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792585829] [2024-11-06 18:50:07,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792585829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:07,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:07,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:50:07,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944694899] [2024-11-06 18:50:07,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:07,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:50:07,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:07,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:50:07,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:50:07,370 INFO L87 Difference]: Start difference. First operand 170 states and 249 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:07,394 INFO L93 Difference]: Finished difference Result 308 states and 453 transitions. [2024-11-06 18:50:07,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:50:07,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-06 18:50:07,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:07,396 INFO L225 Difference]: With dead ends: 308 [2024-11-06 18:50:07,396 INFO L226 Difference]: Without dead ends: 250 [2024-11-06 18:50:07,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-06 18:50:07,397 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 52 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:07,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 297 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-06 18:50:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 236. [2024-11-06 18:50:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 212 states have (on average 1.4103773584905661) internal successors, (299), 216 states have internal predecessors, (299), 20 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (21), 19 states have call predecessors, (21), 18 states have call successors, (21) [2024-11-06 18:50:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 340 transitions. [2024-11-06 18:50:07,427 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 340 transitions. Word has length 39 [2024-11-06 18:50:07,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:07,428 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 340 transitions. [2024-11-06 18:50:07,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:07,428 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 340 transitions. [2024-11-06 18:50:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 18:50:07,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:07,432 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 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-06 18:50:07,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 18:50:07,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:07,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:07,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1761849684, now seen corresponding path program 1 times [2024-11-06 18:50:07,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:07,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216631704] [2024-11-06 18:50:07,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:07,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:07,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:07,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216631704] [2024-11-06 18:50:07,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216631704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:07,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:07,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:07,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604728719] [2024-11-06 18:50:07,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:07,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:07,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:07,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:07,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:07,557 INFO L87 Difference]: Start difference. First operand 236 states and 340 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:07,602 INFO L93 Difference]: Finished difference Result 370 states and 536 transitions. [2024-11-06 18:50:07,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:07,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-06 18:50:07,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:07,608 INFO L225 Difference]: With dead ends: 370 [2024-11-06 18:50:07,608 INFO L226 Difference]: Without dead ends: 326 [2024-11-06 18:50:07,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:07,610 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 52 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:07,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 486 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:07,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-06 18:50:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 300. [2024-11-06 18:50:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 269 states have (on average 1.4089219330855018) internal successors, (379), 275 states have internal predecessors, (379), 27 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (28), 26 states have call predecessors, (28), 25 states have call successors, (28) [2024-11-06 18:50:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 434 transitions. [2024-11-06 18:50:07,645 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 434 transitions. Word has length 40 [2024-11-06 18:50:07,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:07,647 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 434 transitions. [2024-11-06 18:50:07,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:07,647 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 434 transitions. [2024-11-06 18:50:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 18:50:07,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:07,652 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 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-06 18:50:07,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 18:50:07,653 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:07,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:07,653 INFO L85 PathProgramCache]: Analyzing trace with hash 740781330, now seen corresponding path program 1 times [2024-11-06 18:50:07,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:07,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278724784] [2024-11-06 18:50:07,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:07,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:07,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:07,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278724784] [2024-11-06 18:50:07,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278724784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:07,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:07,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:50:07,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190509023] [2024-11-06 18:50:07,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:07,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:50:07,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:07,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:50:07,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:50:07,737 INFO L87 Difference]: Start difference. First operand 300 states and 434 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:07,762 INFO L93 Difference]: Finished difference Result 309 states and 444 transitions. [2024-11-06 18:50:07,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:50:07,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-06 18:50:07,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:07,765 INFO L225 Difference]: With dead ends: 309 [2024-11-06 18:50:07,766 INFO L226 Difference]: Without dead ends: 302 [2024-11-06 18:50:07,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-06 18:50:07,767 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:07,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:07,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-06 18:50:07,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2024-11-06 18:50:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 271 states have (on average 1.4059040590405905) internal successors, (381), 277 states have internal predecessors, (381), 27 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (28), 26 states have call predecessors, (28), 25 states have call successors, (28) [2024-11-06 18:50:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 436 transitions. [2024-11-06 18:50:07,791 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 436 transitions. Word has length 40 [2024-11-06 18:50:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:07,792 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 436 transitions. [2024-11-06 18:50:07,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 436 transitions. [2024-11-06 18:50:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 18:50:07,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:07,796 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 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-06 18:50:07,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 18:50:07,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:07,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:07,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2116211210, now seen corresponding path program 1 times [2024-11-06 18:50:07,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:07,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458735571] [2024-11-06 18:50:07,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:07,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:08,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:08,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458735571] [2024-11-06 18:50:08,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458735571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:08,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063248632] [2024-11-06 18:50:08,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:08,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:08,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:08,018 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-06 18:50:08,020 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-06 18:50:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-06 18:50:08,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:08,205 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:08,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:08,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063248632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:08,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:08,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-06 18:50:08,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429126160] [2024-11-06 18:50:08,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:08,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:08,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:08,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:08,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-06 18:50:08,209 INFO L87 Difference]: Start difference. First operand 302 states and 436 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:08,316 INFO L93 Difference]: Finished difference Result 525 states and 768 transitions. [2024-11-06 18:50:08,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:08,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-06 18:50:08,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:08,320 INFO L225 Difference]: With dead ends: 525 [2024-11-06 18:50:08,320 INFO L226 Difference]: Without dead ends: 444 [2024-11-06 18:50:08,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-06 18:50:08,323 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 72 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:08,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 810 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-06 18:50:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 443. [2024-11-06 18:50:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 398 states have (on average 1.414572864321608) internal successors, (563), 406 states have internal predecessors, (563), 40 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (44), 40 states have call predecessors, (44), 38 states have call successors, (44) [2024-11-06 18:50:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 647 transitions. [2024-11-06 18:50:08,354 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 647 transitions. Word has length 40 [2024-11-06 18:50:08,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:08,354 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 647 transitions. [2024-11-06 18:50:08,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:08,354 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 647 transitions. [2024-11-06 18:50:08,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-06 18:50:08,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:08,356 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 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-06 18:50:08,375 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-06 18:50:08,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:08,556 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:08,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:08,557 INFO L85 PathProgramCache]: Analyzing trace with hash 484387891, now seen corresponding path program 1 times [2024-11-06 18:50:08,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:08,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158196246] [2024-11-06 18:50:08,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:08,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:08,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:08,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158196246] [2024-11-06 18:50:08,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158196246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:08,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:08,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:08,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813190132] [2024-11-06 18:50:08,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:08,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:08,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:08,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:08,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:08,643 INFO L87 Difference]: Start difference. First operand 443 states and 647 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:08,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:08,683 INFO L93 Difference]: Finished difference Result 744 states and 1096 transitions. [2024-11-06 18:50:08,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:08,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-11-06 18:50:08,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:08,687 INFO L225 Difference]: With dead ends: 744 [2024-11-06 18:50:08,687 INFO L226 Difference]: Without dead ends: 658 [2024-11-06 18:50:08,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:08,688 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 53 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:08,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 502 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-06 18:50:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 563. [2024-11-06 18:50:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 510 states have (on average 1.4058823529411764) internal successors, (717), 516 states have internal predecessors, (717), 48 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (52), 48 states have call predecessors, (52), 46 states have call successors, (52) [2024-11-06 18:50:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 817 transitions. [2024-11-06 18:50:08,712 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 817 transitions. Word has length 41 [2024-11-06 18:50:08,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:08,712 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 817 transitions. [2024-11-06 18:50:08,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:08,712 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 817 transitions. [2024-11-06 18:50:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 18:50:08,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:08,714 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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-06 18:50:08,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 18:50:08,715 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:08,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:08,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2128449260, now seen corresponding path program 1 times [2024-11-06 18:50:08,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:08,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589807775] [2024-11-06 18:50:08,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:08,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:08,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:08,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589807775] [2024-11-06 18:50:08,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589807775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:08,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:08,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:08,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359643339] [2024-11-06 18:50:08,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:08,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:08,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:08,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:08,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:08,792 INFO L87 Difference]: Start difference. First operand 563 states and 817 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:08,815 INFO L93 Difference]: Finished difference Result 576 states and 832 transitions. [2024-11-06 18:50:08,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:08,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-11-06 18:50:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:08,819 INFO L225 Difference]: With dead ends: 576 [2024-11-06 18:50:08,819 INFO L226 Difference]: Without dead ends: 569 [2024-11-06 18:50:08,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:08,820 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:08,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 401 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-06 18:50:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2024-11-06 18:50:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 513 states have (on average 1.4035087719298245) internal successors, (720), 519 states have internal predecessors, (720), 48 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (52), 48 states have call predecessors, (52), 46 states have call successors, (52) [2024-11-06 18:50:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 820 transitions. [2024-11-06 18:50:08,841 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 820 transitions. Word has length 42 [2024-11-06 18:50:08,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:08,841 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 820 transitions. [2024-11-06 18:50:08,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 820 transitions. [2024-11-06 18:50:08,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 18:50:08,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:08,843 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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-06 18:50:08,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 18:50:08,843 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:08,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:08,843 INFO L85 PathProgramCache]: Analyzing trace with hash -391510674, now seen corresponding path program 1 times [2024-11-06 18:50:08,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:08,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992342157] [2024-11-06 18:50:08,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:08,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:08,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:08,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992342157] [2024-11-06 18:50:08,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992342157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:08,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:08,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 18:50:08,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943001070] [2024-11-06 18:50:08,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:08,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 18:50:08,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:08,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 18:50:08,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:50:08,933 INFO L87 Difference]: Start difference. First operand 566 states and 820 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:08,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:08,980 INFO L93 Difference]: Finished difference Result 573 states and 826 transitions. [2024-11-06 18:50:08,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 18:50:08,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-11-06 18:50:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:08,989 INFO L225 Difference]: With dead ends: 573 [2024-11-06 18:50:08,989 INFO L226 Difference]: Without dead ends: 566 [2024-11-06 18:50:08,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:08,990 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 3 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:08,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 530 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:08,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-06 18:50:09,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 560. [2024-11-06 18:50:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 507 states have (on average 1.4003944773175543) internal successors, (710), 513 states have internal predecessors, (710), 48 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (52), 48 states have call predecessors, (52), 46 states have call successors, (52) [2024-11-06 18:50:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 810 transitions. [2024-11-06 18:50:09,018 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 810 transitions. Word has length 42 [2024-11-06 18:50:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:09,018 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 810 transitions. [2024-11-06 18:50:09,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 810 transitions. [2024-11-06 18:50:09,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 18:50:09,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:09,020 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:09,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 18:50:09,020 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:09,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:09,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1040982236, now seen corresponding path program 1 times [2024-11-06 18:50:09,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:09,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140192175] [2024-11-06 18:50:09,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:09,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:09,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:09,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:09,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:09,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:09,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140192175] [2024-11-06 18:50:09,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140192175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:09,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101017068] [2024-11-06 18:50:09,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:09,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:09,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:09,284 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-06 18:50:09,286 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-06 18:50:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:09,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 18:50:09,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:09,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:09,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101017068] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:09,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:50:09,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2024-11-06 18:50:09,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738419721] [2024-11-06 18:50:09,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:09,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 18:50:09,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:09,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 18:50:09,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-06 18:50:09,515 INFO L87 Difference]: Start difference. First operand 560 states and 810 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 18:50:09,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:09,654 INFO L93 Difference]: Finished difference Result 957 states and 1382 transitions. [2024-11-06 18:50:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:50:09,655 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 42 [2024-11-06 18:50:09,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:09,661 INFO L225 Difference]: With dead ends: 957 [2024-11-06 18:50:09,661 INFO L226 Difference]: Without dead ends: 611 [2024-11-06 18:50:09,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-06 18:50:09,662 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 9 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:09,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 899 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-06 18:50:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 589. [2024-11-06 18:50:09,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 533 states have (on average 1.3846153846153846) internal successors, (738), 533 states have internal predecessors, (738), 51 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (61), 57 states have call predecessors, (61), 49 states have call successors, (61) [2024-11-06 18:50:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 850 transitions. [2024-11-06 18:50:09,693 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 850 transitions. Word has length 42 [2024-11-06 18:50:09,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:09,695 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 850 transitions. [2024-11-06 18:50:09,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 18:50:09,695 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 850 transitions. [2024-11-06 18:50:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 18:50:09,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:09,697 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:09,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:09,901 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-06 18:50:09,902 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:09,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:09,902 INFO L85 PathProgramCache]: Analyzing trace with hash -789051416, now seen corresponding path program 1 times [2024-11-06 18:50:09,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:09,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325792233] [2024-11-06 18:50:09,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:09,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,105 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:10,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:10,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325792233] [2024-11-06 18:50:10,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325792233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:10,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024311414] [2024-11-06 18:50:10,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:10,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:10,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:10,109 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-06 18:50:10,111 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-06 18:50:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-06 18:50:10,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:10,309 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:10,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024311414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:10,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:10,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2024-11-06 18:50:10,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235772953] [2024-11-06 18:50:10,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:10,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 18:50:10,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:10,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 18:50:10,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:50:10,311 INFO L87 Difference]: Start difference. First operand 589 states and 850 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:10,462 INFO L93 Difference]: Finished difference Result 777 states and 1125 transitions. [2024-11-06 18:50:10,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:50:10,463 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-06 18:50:10,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:10,466 INFO L225 Difference]: With dead ends: 777 [2024-11-06 18:50:10,466 INFO L226 Difference]: Without dead ends: 629 [2024-11-06 18:50:10,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-06 18:50:10,467 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 80 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:10,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 997 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-06 18:50:10,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 619. [2024-11-06 18:50:10,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 563 states have (on average 1.3730017761989344) internal successors, (773), 563 states have internal predecessors, (773), 51 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (61), 57 states have call predecessors, (61), 49 states have call successors, (61) [2024-11-06 18:50:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 885 transitions. [2024-11-06 18:50:10,490 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 885 transitions. Word has length 44 [2024-11-06 18:50:10,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:10,490 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 885 transitions. [2024-11-06 18:50:10,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 885 transitions. [2024-11-06 18:50:10,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 18:50:10,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:10,492 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:10,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:10,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:10,697 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:10,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash -396024406, now seen corresponding path program 1 times [2024-11-06 18:50:10,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:10,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258897798] [2024-11-06 18:50:10,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:10,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,852 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:10,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:10,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258897798] [2024-11-06 18:50:10,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258897798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:10,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837545042] [2024-11-06 18:50:10,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:10,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:10,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:10,855 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-06 18:50:10,856 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-06 18:50:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-06 18:50:10,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:10,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:11,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:11,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837545042] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:11,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:50:11,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-06 18:50:11,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144184775] [2024-11-06 18:50:11,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:11,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 18:50:11,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:11,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 18:50:11,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:50:11,092 INFO L87 Difference]: Start difference. First operand 619 states and 885 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:50:11,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:11,281 INFO L93 Difference]: Finished difference Result 1247 states and 1786 transitions. [2024-11-06 18:50:11,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 18:50:11,282 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 44 [2024-11-06 18:50:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:11,286 INFO L225 Difference]: With dead ends: 1247 [2024-11-06 18:50:11,286 INFO L226 Difference]: Without dead ends: 761 [2024-11-06 18:50:11,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-06 18:50:11,288 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 29 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:11,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1417 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:11,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-06 18:50:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 753. [2024-11-06 18:50:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 692 states have (on average 1.346820809248555) internal successors, (932), 691 states have internal predecessors, (932), 56 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (68), 65 states have call predecessors, (68), 54 states have call successors, (68) [2024-11-06 18:50:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1056 transitions. [2024-11-06 18:50:11,336 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1056 transitions. Word has length 44 [2024-11-06 18:50:11,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:11,337 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1056 transitions. [2024-11-06 18:50:11,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:50:11,337 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1056 transitions. [2024-11-06 18:50:11,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-06 18:50:11,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:11,340 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:11,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-06 18:50:11,540 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,SelfDestructingSolverStorable11 [2024-11-06 18:50:11,540 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:11,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:11,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1611000684, now seen corresponding path program 1 times [2024-11-06 18:50:11,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:11,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75716961] [2024-11-06 18:50:11,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:11,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:11,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:11,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75716961] [2024-11-06 18:50:11,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75716961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:11,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:11,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:11,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829407290] [2024-11-06 18:50:11,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:11,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:11,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:11,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:11,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:11,598 INFO L87 Difference]: Start difference. First operand 753 states and 1056 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:11,625 INFO L93 Difference]: Finished difference Result 798 states and 1115 transitions. [2024-11-06 18:50:11,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:11,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-06 18:50:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:11,629 INFO L225 Difference]: With dead ends: 798 [2024-11-06 18:50:11,629 INFO L226 Difference]: Without dead ends: 707 [2024-11-06 18:50:11,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:11,630 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 38 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:11,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 459 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-06 18:50:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 567. [2024-11-06 18:50:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 523 states have (on average 1.315487571701721) internal successors, (688), 518 states have internal predecessors, (688), 39 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (51), 48 states have call predecessors, (51), 37 states have call successors, (51) [2024-11-06 18:50:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 778 transitions. [2024-11-06 18:50:11,652 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 778 transitions. Word has length 47 [2024-11-06 18:50:11,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:11,653 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 778 transitions. [2024-11-06 18:50:11,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:11,653 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 778 transitions. [2024-11-06 18:50:11,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 18:50:11,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:11,655 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:11,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 18:50:11,655 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:11,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:11,655 INFO L85 PathProgramCache]: Analyzing trace with hash -928708749, now seen corresponding path program 1 times [2024-11-06 18:50:11,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:11,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140411534] [2024-11-06 18:50:11,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:11,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:11,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:11,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140411534] [2024-11-06 18:50:11,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140411534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:11,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473276642] [2024-11-06 18:50:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:11,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:11,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:11,863 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-06 18:50:11,865 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-06 18:50:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-06 18:50:11,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:12,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:12,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473276642] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:12,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:50:12,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 11] total 15 [2024-11-06 18:50:12,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099187689] [2024-11-06 18:50:12,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:12,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:12,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:12,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:12,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:50:12,135 INFO L87 Difference]: Start difference. First operand 567 states and 778 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:12,295 INFO L93 Difference]: Finished difference Result 903 states and 1252 transitions. [2024-11-06 18:50:12,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:12,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-06 18:50:12,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:12,300 INFO L225 Difference]: With dead ends: 903 [2024-11-06 18:50:12,301 INFO L226 Difference]: Without dead ends: 863 [2024-11-06 18:50:12,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:50:12,302 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 46 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:12,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 631 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-06 18:50:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 737. [2024-11-06 18:50:12,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 673 states have (on average 1.298662704309064) internal successors, (874), 670 states have internal predecessors, (874), 59 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (71), 68 states have call predecessors, (71), 57 states have call successors, (71) [2024-11-06 18:50:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1004 transitions. [2024-11-06 18:50:12,334 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1004 transitions. Word has length 48 [2024-11-06 18:50:12,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:12,334 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1004 transitions. [2024-11-06 18:50:12,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:12,335 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1004 transitions. [2024-11-06 18:50:12,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 18:50:12,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:12,337 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:12,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:12,537 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,SelfDestructingSolverStorable13 [2024-11-06 18:50:12,538 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:12,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:12,538 INFO L85 PathProgramCache]: Analyzing trace with hash -227644171, now seen corresponding path program 1 times [2024-11-06 18:50:12,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:12,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960728096] [2024-11-06 18:50:12,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:12,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:12,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:12,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960728096] [2024-11-06 18:50:12,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960728096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:12,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:12,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:12,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280446150] [2024-11-06 18:50:12,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:12,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:12,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:12,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:12,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:12,581 INFO L87 Difference]: Start difference. First operand 737 states and 1004 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:12,624 INFO L93 Difference]: Finished difference Result 756 states and 1025 transitions. [2024-11-06 18:50:12,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:12,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-06 18:50:12,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:12,627 INFO L225 Difference]: With dead ends: 756 [2024-11-06 18:50:12,628 INFO L226 Difference]: Without dead ends: 690 [2024-11-06 18:50:12,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:12,629 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:12,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 396 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-06 18:50:12,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2024-11-06 18:50:12,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 626 states have (on average 1.3067092651757188) internal successors, (818), 625 states have internal predecessors, (818), 59 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (69), 66 states have call predecessors, (69), 57 states have call successors, (69) [2024-11-06 18:50:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 946 transitions. [2024-11-06 18:50:12,653 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 946 transitions. Word has length 48 [2024-11-06 18:50:12,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:12,653 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 946 transitions. [2024-11-06 18:50:12,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 946 transitions. [2024-11-06 18:50:12,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 18:50:12,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:12,655 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-06 18:50:12,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 18:50:12,655 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:12,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:12,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1414516131, now seen corresponding path program 1 times [2024-11-06 18:50:12,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:12,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290365069] [2024-11-06 18:50:12,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:12,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:12,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:12,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290365069] [2024-11-06 18:50:12,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290365069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:12,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469415501] [2024-11-06 18:50:12,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:12,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:12,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:12,786 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:12,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-06 18:50:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:12,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-06 18:50:12,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:12,965 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:12,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:12,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469415501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:12,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:12,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 10 [2024-11-06 18:50:12,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473593884] [2024-11-06 18:50:12,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:12,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 18:50:12,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:12,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 18:50:12,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-06 18:50:12,967 INFO L87 Difference]: Start difference. First operand 690 states and 946 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:13,204 INFO L93 Difference]: Finished difference Result 1378 states and 1901 transitions. [2024-11-06 18:50:13,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 18:50:13,204 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2024-11-06 18:50:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:13,209 INFO L225 Difference]: With dead ends: 1378 [2024-11-06 18:50:13,209 INFO L226 Difference]: Without dead ends: 1086 [2024-11-06 18:50:13,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-06 18:50:13,212 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 161 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:13,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1114 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:50:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2024-11-06 18:50:13,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 901. [2024-11-06 18:50:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 817 states have (on average 1.3231334149326806) internal successors, (1081), 812 states have internal predecessors, (1081), 79 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (93), 90 states have call predecessors, (93), 77 states have call successors, (93) [2024-11-06 18:50:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1253 transitions. [2024-11-06 18:50:13,248 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1253 transitions. Word has length 48 [2024-11-06 18:50:13,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:13,248 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1253 transitions. [2024-11-06 18:50:13,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1253 transitions. [2024-11-06 18:50:13,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-06 18:50:13,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:13,251 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:13,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-06 18:50:13,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-06 18:50:13,456 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:13,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:13,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1738528056, now seen corresponding path program 1 times [2024-11-06 18:50:13,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:13,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869265491] [2024-11-06 18:50:13,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:13,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:13,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:13,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:13,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:50:13,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:13,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869265491] [2024-11-06 18:50:13,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869265491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:13,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518228924] [2024-11-06 18:50:13,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:13,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:13,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:13,896 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:13,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-06 18:50:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:13,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-06 18:50:13,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:14,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:14,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518228924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:14,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:14,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 24 [2024-11-06 18:50:14,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494488074] [2024-11-06 18:50:14,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:14,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 18:50:14,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:14,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 18:50:14,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2024-11-06 18:50:14,177 INFO L87 Difference]: Start difference. First operand 901 states and 1253 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:14,438 INFO L93 Difference]: Finished difference Result 1041 states and 1439 transitions. [2024-11-06 18:50:14,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 18:50:14,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-06 18:50:14,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:14,443 INFO L225 Difference]: With dead ends: 1041 [2024-11-06 18:50:14,443 INFO L226 Difference]: Without dead ends: 1004 [2024-11-06 18:50:14,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2024-11-06 18:50:14,445 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 135 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:14,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1122 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:50:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2024-11-06 18:50:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 933. [2024-11-06 18:50:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 845 states have (on average 1.3124260355029587) internal successors, (1109), 842 states have internal predecessors, (1109), 83 states have call successors, (83), 2 states have call predecessors, (83), 4 states have return successors, (96), 93 states have call predecessors, (96), 80 states have call successors, (96) [2024-11-06 18:50:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1288 transitions. [2024-11-06 18:50:14,476 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1288 transitions. Word has length 50 [2024-11-06 18:50:14,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:14,476 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1288 transitions. [2024-11-06 18:50:14,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1288 transitions. [2024-11-06 18:50:14,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-06 18:50:14,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:14,478 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:14,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-06 18:50:14,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:14,679 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:14,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:14,679 INFO L85 PathProgramCache]: Analyzing trace with hash 636967370, now seen corresponding path program 1 times [2024-11-06 18:50:14,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:14,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666844479] [2024-11-06 18:50:14,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:14,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:14,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:14,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666844479] [2024-11-06 18:50:14,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666844479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:14,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:14,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 18:50:14,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130217357] [2024-11-06 18:50:14,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:14,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 18:50:14,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:14,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 18:50:14,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:50:14,766 INFO L87 Difference]: Start difference. First operand 933 states and 1288 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:14,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:14,902 INFO L93 Difference]: Finished difference Result 1088 states and 1490 transitions. [2024-11-06 18:50:14,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 18:50:14,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-06 18:50:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:14,907 INFO L225 Difference]: With dead ends: 1088 [2024-11-06 18:50:14,907 INFO L226 Difference]: Without dead ends: 1052 [2024-11-06 18:50:14,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:14,909 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 46 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:14,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 567 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-11-06 18:50:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1005. [2024-11-06 18:50:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 908 states have (on average 1.3204845814977975) internal successors, (1199), 907 states have internal predecessors, (1199), 92 states have call successors, (92), 2 states have call predecessors, (92), 4 states have return successors, (105), 101 states have call predecessors, (105), 89 states have call successors, (105) [2024-11-06 18:50:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1396 transitions. [2024-11-06 18:50:14,960 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1396 transitions. Word has length 50 [2024-11-06 18:50:14,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:14,960 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1396 transitions. [2024-11-06 18:50:14,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:14,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1396 transitions. [2024-11-06 18:50:14,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-06 18:50:14,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:14,965 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:14,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 18:50:14,965 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:14,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:14,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1829184296, now seen corresponding path program 1 times [2024-11-06 18:50:14,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:14,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939629923] [2024-11-06 18:50:14,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:14,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:15,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:15,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939629923] [2024-11-06 18:50:15,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939629923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:15,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915473604] [2024-11-06 18:50:15,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:15,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:15,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:15,165 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:15,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-06 18:50:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:15,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-06 18:50:15,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:15,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:15,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915473604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:15,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:15,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 15 [2024-11-06 18:50:15,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767939150] [2024-11-06 18:50:15,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:15,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 18:50:15,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:15,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 18:50:15,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:50:15,410 INFO L87 Difference]: Start difference. First operand 1005 states and 1396 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:15,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:15,794 INFO L93 Difference]: Finished difference Result 1134 states and 1551 transitions. [2024-11-06 18:50:15,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 18:50:15,794 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-06 18:50:15,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:15,799 INFO L225 Difference]: With dead ends: 1134 [2024-11-06 18:50:15,799 INFO L226 Difference]: Without dead ends: 1132 [2024-11-06 18:50:15,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-06 18:50:15,800 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 164 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:15,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1827 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:50:15,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-11-06 18:50:15,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1009. [2024-11-06 18:50:15,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 911 states have (on average 1.3194291986827662) internal successors, (1202), 910 states have internal predecessors, (1202), 92 states have call successors, (92), 3 states have call predecessors, (92), 5 states have return successors, (105), 101 states have call predecessors, (105), 89 states have call successors, (105) [2024-11-06 18:50:15,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1399 transitions. [2024-11-06 18:50:15,834 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1399 transitions. Word has length 50 [2024-11-06 18:50:15,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:15,835 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1399 transitions. [2024-11-06 18:50:15,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1399 transitions. [2024-11-06 18:50:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-06 18:50:15,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:15,837 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:15,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:16,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:16,038 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:16,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:16,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1086009428, now seen corresponding path program 1 times [2024-11-06 18:50:16,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:16,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809729699] [2024-11-06 18:50:16,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:16,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:16,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:16,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:16,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 18:50:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:16,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:16,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809729699] [2024-11-06 18:50:16,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809729699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:16,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771259533] [2024-11-06 18:50:16,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:16,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:16,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:16,079 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:16,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-06 18:50:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:16,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:50:16,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 18:50:16,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:16,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771259533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:16,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:16,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-06 18:50:16,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293724871] [2024-11-06 18:50:16,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:16,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:50:16,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:16,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:50:16,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:16,156 INFO L87 Difference]: Start difference. First operand 1009 states and 1399 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:16,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:16,209 INFO L93 Difference]: Finished difference Result 2012 states and 2793 transitions. [2024-11-06 18:50:16,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:50:16,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-06 18:50:16,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:16,214 INFO L225 Difference]: With dead ends: 2012 [2024-11-06 18:50:16,215 INFO L226 Difference]: Without dead ends: 1014 [2024-11-06 18:50:16,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:16,218 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 6 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:16,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 245 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:16,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2024-11-06 18:50:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1012. [2024-11-06 18:50:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 914 states have (on average 1.3194748358862145) internal successors, (1206), 913 states have internal predecessors, (1206), 92 states have call successors, (92), 3 states have call predecessors, (92), 5 states have return successors, (105), 101 states have call predecessors, (105), 89 states have call successors, (105) [2024-11-06 18:50:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1403 transitions. [2024-11-06 18:50:16,252 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1403 transitions. Word has length 51 [2024-11-06 18:50:16,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:16,252 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1403 transitions. [2024-11-06 18:50:16,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:16,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1403 transitions. [2024-11-06 18:50:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-06 18:50:16,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:16,254 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:16,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-06 18:50:16,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:16,455 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:16,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:16,456 INFO L85 PathProgramCache]: Analyzing trace with hash -542193564, now seen corresponding path program 1 times [2024-11-06 18:50:16,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:16,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054029321] [2024-11-06 18:50:16,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:16,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:16,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:16,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:16,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:16,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:16,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054029321] [2024-11-06 18:50:16,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054029321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:16,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:16,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:16,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054871703] [2024-11-06 18:50:16,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:16,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:16,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:16,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:16,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:16,515 INFO L87 Difference]: Start difference. First operand 1012 states and 1403 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:16,540 INFO L93 Difference]: Finished difference Result 1021 states and 1411 transitions. [2024-11-06 18:50:16,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:16,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-06 18:50:16,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:16,547 INFO L225 Difference]: With dead ends: 1021 [2024-11-06 18:50:16,547 INFO L226 Difference]: Without dead ends: 975 [2024-11-06 18:50:16,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:16,549 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:16,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 393 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-06 18:50:16,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 954. [2024-11-06 18:50:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 860 states have (on average 1.319767441860465) internal successors, (1135), 859 states have internal predecessors, (1135), 88 states have call successors, (88), 3 states have call predecessors, (88), 5 states have return successors, (99), 95 states have call predecessors, (99), 85 states have call successors, (99) [2024-11-06 18:50:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1322 transitions. [2024-11-06 18:50:16,582 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1322 transitions. Word has length 52 [2024-11-06 18:50:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:16,582 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1322 transitions. [2024-11-06 18:50:16,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1322 transitions. [2024-11-06 18:50:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-06 18:50:16,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:16,586 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:16,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-06 18:50:16,586 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:16,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:16,586 INFO L85 PathProgramCache]: Analyzing trace with hash 715958260, now seen corresponding path program 1 times [2024-11-06 18:50:16,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:16,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986332208] [2024-11-06 18:50:16,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:16,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:16,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:16,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:16,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-06 18:50:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:16,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:16,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986332208] [2024-11-06 18:50:16,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986332208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:16,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568213093] [2024-11-06 18:50:16,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:16,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:16,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:16,631 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:16,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-06 18:50:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:16,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:50:16,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 18:50:16,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:16,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568213093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:16,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:16,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-06 18:50:16,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401663529] [2024-11-06 18:50:16,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:16,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:50:16,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:16,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:50:16,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:50:16,706 INFO L87 Difference]: Start difference. First operand 954 states and 1322 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:16,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:16,757 INFO L93 Difference]: Finished difference Result 1905 states and 2647 transitions. [2024-11-06 18:50:16,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:50:16,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2024-11-06 18:50:16,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:16,762 INFO L225 Difference]: With dead ends: 1905 [2024-11-06 18:50:16,762 INFO L226 Difference]: Without dead ends: 960 [2024-11-06 18:50:16,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:50:16,766 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:16,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 246 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:16,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-06 18:50:16,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 956. [2024-11-06 18:50:16,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 862 states have (on average 1.3190255220417633) internal successors, (1137), 861 states have internal predecessors, (1137), 88 states have call successors, (88), 3 states have call predecessors, (88), 5 states have return successors, (99), 95 states have call predecessors, (99), 85 states have call successors, (99) [2024-11-06 18:50:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1324 transitions. [2024-11-06 18:50:16,815 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1324 transitions. Word has length 52 [2024-11-06 18:50:16,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:16,815 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1324 transitions. [2024-11-06 18:50:16,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1324 transitions. [2024-11-06 18:50:16,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-06 18:50:16,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:16,817 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:16,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:17,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:17,022 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:17,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:17,022 INFO L85 PathProgramCache]: Analyzing trace with hash 402749068, now seen corresponding path program 1 times [2024-11-06 18:50:17,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:17,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065290122] [2024-11-06 18:50:17,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:17,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:17,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:17,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:17,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:17,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:17,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:17,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065290122] [2024-11-06 18:50:17,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065290122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:17,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:17,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 18:50:17,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191762783] [2024-11-06 18:50:17,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:17,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 18:50:17,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:17,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 18:50:17,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:17,153 INFO L87 Difference]: Start difference. First operand 956 states and 1324 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:17,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:17,386 INFO L93 Difference]: Finished difference Result 1307 states and 1822 transitions. [2024-11-06 18:50:17,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:50:17,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-06 18:50:17,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:17,392 INFO L225 Difference]: With dead ends: 1307 [2024-11-06 18:50:17,392 INFO L226 Difference]: Without dead ends: 1250 [2024-11-06 18:50:17,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:50:17,393 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 54 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:17,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 625 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:50:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-06 18:50:17,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 990. [2024-11-06 18:50:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 888 states have (on average 1.3322072072072073) internal successors, (1183), 889 states have internal predecessors, (1183), 96 states have call successors, (96), 3 states have call predecessors, (96), 5 states have return successors, (103), 101 states have call predecessors, (103), 93 states have call successors, (103) [2024-11-06 18:50:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1382 transitions. [2024-11-06 18:50:17,431 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1382 transitions. Word has length 52 [2024-11-06 18:50:17,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:17,431 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1382 transitions. [2024-11-06 18:50:17,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1382 transitions. [2024-11-06 18:50:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-06 18:50:17,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:17,433 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:17,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-06 18:50:17,433 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:17,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1996652087, now seen corresponding path program 1 times [2024-11-06 18:50:17,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:17,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188685382] [2024-11-06 18:50:17,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:17,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:17,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:17,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:17,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 18:50:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:17,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:17,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188685382] [2024-11-06 18:50:17,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188685382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:17,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:17,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-06 18:50:17,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073343745] [2024-11-06 18:50:17,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:17,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 18:50:17,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:17,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 18:50:17,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-06 18:50:17,804 INFO L87 Difference]: Start difference. First operand 990 states and 1382 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:18,095 INFO L93 Difference]: Finished difference Result 1082 states and 1505 transitions. [2024-11-06 18:50:18,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 18:50:18,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-06 18:50:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:18,101 INFO L225 Difference]: With dead ends: 1082 [2024-11-06 18:50:18,101 INFO L226 Difference]: Without dead ends: 1080 [2024-11-06 18:50:18,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-06 18:50:18,103 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 119 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:18,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1664 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:50:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-11-06 18:50:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 994. [2024-11-06 18:50:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 891 states have (on average 1.3310886644219977) internal successors, (1186), 892 states have internal predecessors, (1186), 96 states have call successors, (96), 4 states have call predecessors, (96), 6 states have return successors, (103), 101 states have call predecessors, (103), 93 states have call successors, (103) [2024-11-06 18:50:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1385 transitions. [2024-11-06 18:50:18,153 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1385 transitions. Word has length 53 [2024-11-06 18:50:18,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:18,154 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1385 transitions. [2024-11-06 18:50:18,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1385 transitions. [2024-11-06 18:50:18,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-06 18:50:18,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:18,156 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:18,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-06 18:50:18,156 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:18,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:18,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1712366785, now seen corresponding path program 1 times [2024-11-06 18:50:18,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:18,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220842021] [2024-11-06 18:50:18,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:18,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:18,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:18,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:18,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:18,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:18,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220842021] [2024-11-06 18:50:18,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220842021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:18,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675290925] [2024-11-06 18:50:18,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:18,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:18,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:18,338 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:18,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-06 18:50:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:18,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-06 18:50:18,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:18,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:18,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675290925] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:18,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:50:18,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-06 18:50:18,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505140309] [2024-11-06 18:50:18,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:18,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 18:50:18,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:18,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 18:50:18,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:50:18,561 INFO L87 Difference]: Start difference. First operand 994 states and 1385 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:50:18,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:18,827 INFO L93 Difference]: Finished difference Result 1436 states and 2001 transitions. [2024-11-06 18:50:18,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 18:50:18,827 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2024-11-06 18:50:18,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:18,832 INFO L225 Difference]: With dead ends: 1436 [2024-11-06 18:50:18,832 INFO L226 Difference]: Without dead ends: 1114 [2024-11-06 18:50:18,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-06 18:50:18,834 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 136 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:18,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1167 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:50:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2024-11-06 18:50:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 950. [2024-11-06 18:50:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 853 states have (on average 1.3153575615474795) internal successors, (1122), 854 states have internal predecessors, (1122), 90 states have call successors, (90), 4 states have call predecessors, (90), 6 states have return successors, (97), 95 states have call predecessors, (97), 87 states have call successors, (97) [2024-11-06 18:50:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1309 transitions. [2024-11-06 18:50:18,877 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1309 transitions. Word has length 53 [2024-11-06 18:50:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:18,877 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1309 transitions. [2024-11-06 18:50:18,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:50:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1309 transitions. [2024-11-06 18:50:18,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-06 18:50:18,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:18,879 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:18,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:19,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-06 18:50:19,084 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:19,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:19,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1600809393, now seen corresponding path program 1 times [2024-11-06 18:50:19,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:19,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90932340] [2024-11-06 18:50:19,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:19,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:19,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:19,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:19,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:19,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:19,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90932340] [2024-11-06 18:50:19,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90932340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:19,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978523733] [2024-11-06 18:50:19,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:19,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:19,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:19,279 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:19,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-06 18:50:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:19,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-06 18:50:19,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:19,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:19,563 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 18:50:19,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978523733] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:19,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:50:19,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 10] total 19 [2024-11-06 18:50:19,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135668145] [2024-11-06 18:50:19,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:19,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:19,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:19,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:19,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-06 18:50:19,565 INFO L87 Difference]: Start difference. First operand 950 states and 1309 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:19,755 INFO L93 Difference]: Finished difference Result 1056 states and 1434 transitions. [2024-11-06 18:50:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:50:19,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-06 18:50:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:19,760 INFO L225 Difference]: With dead ends: 1056 [2024-11-06 18:50:19,760 INFO L226 Difference]: Without dead ends: 1001 [2024-11-06 18:50:19,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-06 18:50:19,761 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:19,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 493 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-06 18:50:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 928. [2024-11-06 18:50:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 835 states have (on average 1.2850299401197605) internal successors, (1073), 839 states have internal predecessors, (1073), 86 states have call successors, (86), 4 states have call predecessors, (86), 6 states have return successors, (93), 87 states have call predecessors, (93), 83 states have call successors, (93) [2024-11-06 18:50:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1252 transitions. [2024-11-06 18:50:19,798 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1252 transitions. Word has length 54 [2024-11-06 18:50:19,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:19,798 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1252 transitions. [2024-11-06 18:50:19,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:19,798 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1252 transitions. [2024-11-06 18:50:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 18:50:19,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:19,800 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:19,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:20,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:20,001 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:20,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:20,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1093181230, now seen corresponding path program 1 times [2024-11-06 18:50:20,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:20,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271495954] [2024-11-06 18:50:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:20,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:20,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:20,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:20,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:50:20,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:20,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271495954] [2024-11-06 18:50:20,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271495954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:20,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876015575] [2024-11-06 18:50:20,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:20,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:20,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:20,450 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:20,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-06 18:50:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:20,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-06 18:50:20,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:20,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:20,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876015575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:20,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:20,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 23 [2024-11-06 18:50:20,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622728022] [2024-11-06 18:50:20,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:20,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 18:50:20,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:20,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 18:50:20,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-11-06 18:50:20,654 INFO L87 Difference]: Start difference. First operand 928 states and 1252 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:20,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:20,858 INFO L93 Difference]: Finished difference Result 1181 states and 1594 transitions. [2024-11-06 18:50:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:50:20,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-06 18:50:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:20,863 INFO L225 Difference]: With dead ends: 1181 [2024-11-06 18:50:20,863 INFO L226 Difference]: Without dead ends: 1104 [2024-11-06 18:50:20,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-11-06 18:50:20,864 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 59 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:20,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1034 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:50:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2024-11-06 18:50:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 839. [2024-11-06 18:50:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 756 states have (on average 1.283068783068783) internal successors, (970), 762 states have internal predecessors, (970), 76 states have call successors, (76), 4 states have call predecessors, (76), 6 states have return successors, (81), 75 states have call predecessors, (81), 73 states have call successors, (81) [2024-11-06 18:50:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1127 transitions. [2024-11-06 18:50:20,909 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1127 transitions. Word has length 55 [2024-11-06 18:50:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:20,909 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1127 transitions. [2024-11-06 18:50:20,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:20,910 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1127 transitions. [2024-11-06 18:50:20,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 18:50:20,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:20,912 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:20,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:21,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:21,116 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:21,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:21,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1378877764, now seen corresponding path program 1 times [2024-11-06 18:50:21,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:21,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517513875] [2024-11-06 18:50:21,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:21,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 18:50:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 18:50:21,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:21,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517513875] [2024-11-06 18:50:21,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517513875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:21,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:21,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 18:50:21,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129990462] [2024-11-06 18:50:21,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:21,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 18:50:21,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:21,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 18:50:21,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:21,328 INFO L87 Difference]: Start difference. First operand 839 states and 1127 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:21,416 INFO L93 Difference]: Finished difference Result 845 states and 1132 transitions. [2024-11-06 18:50:21,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 18:50:21,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-06 18:50:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:21,420 INFO L225 Difference]: With dead ends: 845 [2024-11-06 18:50:21,420 INFO L226 Difference]: Without dead ends: 843 [2024-11-06 18:50:21,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:50:21,422 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 12 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:21,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 712 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-11-06 18:50:21,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2024-11-06 18:50:21,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 759 states have (on average 1.2819499341238472) internal successors, (973), 765 states have internal predecessors, (973), 76 states have call successors, (76), 5 states have call predecessors, (76), 7 states have return successors, (81), 75 states have call predecessors, (81), 73 states have call successors, (81) [2024-11-06 18:50:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1130 transitions. [2024-11-06 18:50:21,455 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1130 transitions. Word has length 55 [2024-11-06 18:50:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:21,455 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1130 transitions. [2024-11-06 18:50:21,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1130 transitions. [2024-11-06 18:50:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-06 18:50:21,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:21,456 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:21,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-06 18:50:21,456 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:21,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:21,457 INFO L85 PathProgramCache]: Analyzing trace with hash 38676205, now seen corresponding path program 1 times [2024-11-06 18:50:21,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:21,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694545385] [2024-11-06 18:50:21,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:21,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 18:50:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 18:50:21,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:21,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694545385] [2024-11-06 18:50:21,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694545385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:21,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:21,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:50:21,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939787141] [2024-11-06 18:50:21,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:21,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:21,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:21,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:21,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:21,551 INFO L87 Difference]: Start difference. First operand 843 states and 1130 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:21,609 INFO L93 Difference]: Finished difference Result 870 states and 1158 transitions. [2024-11-06 18:50:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:21,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2024-11-06 18:50:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:21,613 INFO L225 Difference]: With dead ends: 870 [2024-11-06 18:50:21,613 INFO L226 Difference]: Without dead ends: 868 [2024-11-06 18:50:21,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:21,614 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 19 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:21,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 732 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:21,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-11-06 18:50:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 849. [2024-11-06 18:50:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 763 states have (on average 1.2804718217562254) internal successors, (977), 770 states have internal predecessors, (977), 77 states have call successors, (77), 6 states have call predecessors, (77), 8 states have return successors, (82), 75 states have call predecessors, (82), 74 states have call successors, (82) [2024-11-06 18:50:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1136 transitions. [2024-11-06 18:50:21,648 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1136 transitions. Word has length 56 [2024-11-06 18:50:21,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:21,648 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1136 transitions. [2024-11-06 18:50:21,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1136 transitions. [2024-11-06 18:50:21,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-06 18:50:21,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:21,651 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:21,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-06 18:50:21,651 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:21,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:21,651 INFO L85 PathProgramCache]: Analyzing trace with hash 95934507, now seen corresponding path program 1 times [2024-11-06 18:50:21,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:21,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097075441] [2024-11-06 18:50:21,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:21,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 18:50:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 18:50:21,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:21,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097075441] [2024-11-06 18:50:21,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097075441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:21,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:21,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:50:21,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048994885] [2024-11-06 18:50:21,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:21,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:21,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:21,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:21,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:21,725 INFO L87 Difference]: Start difference. First operand 849 states and 1136 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:21,779 INFO L93 Difference]: Finished difference Result 859 states and 1145 transitions. [2024-11-06 18:50:21,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:21,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2024-11-06 18:50:21,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:21,783 INFO L225 Difference]: With dead ends: 859 [2024-11-06 18:50:21,783 INFO L226 Difference]: Without dead ends: 857 [2024-11-06 18:50:21,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:21,784 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 8 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:21,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 645 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-06 18:50:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 853. [2024-11-06 18:50:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 766 states have (on average 1.279373368146214) internal successors, (980), 773 states have internal predecessors, (980), 77 states have call successors, (77), 7 states have call predecessors, (77), 9 states have return successors, (82), 75 states have call predecessors, (82), 74 states have call successors, (82) [2024-11-06 18:50:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1139 transitions. [2024-11-06 18:50:21,831 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1139 transitions. Word has length 56 [2024-11-06 18:50:21,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:21,832 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1139 transitions. [2024-11-06 18:50:21,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:21,832 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1139 transitions. [2024-11-06 18:50:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-06 18:50:21,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:21,833 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:21,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-06 18:50:21,833 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:21,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:21,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1674208059, now seen corresponding path program 1 times [2024-11-06 18:50:21,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:21,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923951337] [2024-11-06 18:50:21,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:21,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-06 18:50:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:22,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:22,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923951337] [2024-11-06 18:50:22,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923951337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:22,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:22,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-06 18:50:22,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053662527] [2024-11-06 18:50:22,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:22,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-06 18:50:22,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:22,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-06 18:50:22,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:50:22,349 INFO L87 Difference]: Start difference. First operand 853 states and 1139 transitions. Second operand has 15 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-06 18:50:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:22,726 INFO L93 Difference]: Finished difference Result 1040 states and 1381 transitions. [2024-11-06 18:50:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 18:50:22,727 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 58 [2024-11-06 18:50:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:22,731 INFO L225 Difference]: With dead ends: 1040 [2024-11-06 18:50:22,731 INFO L226 Difference]: Without dead ends: 942 [2024-11-06 18:50:22,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-06 18:50:22,732 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 173 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:22,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1368 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:50:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2024-11-06 18:50:22,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 858. [2024-11-06 18:50:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 769 states have (on average 1.2756827048114434) internal successors, (981), 775 states have internal predecessors, (981), 78 states have call successors, (78), 8 states have call predecessors, (78), 10 states have return successors, (83), 77 states have call predecessors, (83), 75 states have call successors, (83) [2024-11-06 18:50:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1142 transitions. [2024-11-06 18:50:22,768 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1142 transitions. Word has length 58 [2024-11-06 18:50:22,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:22,768 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1142 transitions. [2024-11-06 18:50:22,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-06 18:50:22,768 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1142 transitions. [2024-11-06 18:50:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-06 18:50:22,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:22,770 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:22,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-06 18:50:22,770 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:22,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:22,770 INFO L85 PathProgramCache]: Analyzing trace with hash -232984945, now seen corresponding path program 1 times [2024-11-06 18:50:22,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:22,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762076805] [2024-11-06 18:50:22,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:22,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 18:50:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-06 18:50:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:22,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:22,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762076805] [2024-11-06 18:50:22,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762076805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:22,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:22,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-06 18:50:22,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978965230] [2024-11-06 18:50:22,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:22,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 18:50:22,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:22,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 18:50:22,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:50:22,959 INFO L87 Difference]: Start difference. First operand 858 states and 1142 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:50:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:23,204 INFO L93 Difference]: Finished difference Result 1242 states and 1671 transitions. [2024-11-06 18:50:23,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 18:50:23,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2024-11-06 18:50:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:23,212 INFO L225 Difference]: With dead ends: 1242 [2024-11-06 18:50:23,213 INFO L226 Difference]: Without dead ends: 1072 [2024-11-06 18:50:23,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-06 18:50:23,216 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 120 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:23,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1215 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:50:23,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-11-06 18:50:23,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 858. [2024-11-06 18:50:23,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 769 states have (on average 1.270481144343303) internal successors, (977), 775 states have internal predecessors, (977), 78 states have call successors, (78), 8 states have call predecessors, (78), 10 states have return successors, (83), 77 states have call predecessors, (83), 75 states have call successors, (83) [2024-11-06 18:50:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1138 transitions. [2024-11-06 18:50:23,261 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1138 transitions. Word has length 59 [2024-11-06 18:50:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:23,261 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1138 transitions. [2024-11-06 18:50:23,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:50:23,262 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1138 transitions. [2024-11-06 18:50:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-06 18:50:23,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:23,263 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:23,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-06 18:50:23,264 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:23,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:23,264 INFO L85 PathProgramCache]: Analyzing trace with hash 802334154, now seen corresponding path program 1 times [2024-11-06 18:50:23,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:23,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371058396] [2024-11-06 18:50:23,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:23,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:23,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:23,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:23,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 18:50:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:23,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 18:50:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 18:50:23,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:23,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371058396] [2024-11-06 18:50:23,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371058396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:23,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733715998] [2024-11-06 18:50:23,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:23,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:23,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:23,635 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:23,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-06 18:50:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:23,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-06 18:50:23,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:24,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:30,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733715998] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:30,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:50:30,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 17] total 37 [2024-11-06 18:50:30,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625276922] [2024-11-06 18:50:30,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:30,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-06 18:50:30,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:30,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-06 18:50:30,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1233, Unknown=1, NotChecked=0, Total=1332 [2024-11-06 18:50:30,769 INFO L87 Difference]: Start difference. First operand 858 states and 1138 transitions. Second operand has 37 states, 34 states have (on average 3.088235294117647) internal successors, (105), 31 states have internal predecessors, (105), 8 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-06 18:50:32,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:32,883 INFO L93 Difference]: Finished difference Result 1618 states and 2164 transitions. [2024-11-06 18:50:32,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-06 18:50:32,884 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 3.088235294117647) internal successors, (105), 31 states have internal predecessors, (105), 8 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) Word has length 61 [2024-11-06 18:50:32,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:32,889 INFO L225 Difference]: With dead ends: 1618 [2024-11-06 18:50:32,889 INFO L226 Difference]: Without dead ends: 1426 [2024-11-06 18:50:32,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=272, Invalid=3033, Unknown=1, NotChecked=0, Total=3306 [2024-11-06 18:50:32,892 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 420 mSDsluCounter, 3629 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 3783 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:32,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 3783 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1892 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 18:50:32,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2024-11-06 18:50:32,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 911. [2024-11-06 18:50:32,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 814 states have (on average 1.2616707616707616) internal successors, (1027), 816 states have internal predecessors, (1027), 83 states have call successors, (83), 10 states have call predecessors, (83), 13 states have return successors, (99), 87 states have call predecessors, (99), 80 states have call successors, (99) [2024-11-06 18:50:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1209 transitions. [2024-11-06 18:50:32,958 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1209 transitions. Word has length 61 [2024-11-06 18:50:32,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:32,958 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1209 transitions. [2024-11-06 18:50:32,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 3.088235294117647) internal successors, (105), 31 states have internal predecessors, (105), 8 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (10), 9 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-06 18:50:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1209 transitions. [2024-11-06 18:50:32,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-06 18:50:32,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:32,960 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:32,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:33,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-06 18:50:33,161 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:33,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:33,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1601933524, now seen corresponding path program 1 times [2024-11-06 18:50:33,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:33,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537110319] [2024-11-06 18:50:33,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:33,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 18:50:33,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 18:50:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 18:50:33,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 18:50:33,250 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 18:50:33,251 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:50:33,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-06 18:50:33,255 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:33,287 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:50:33,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:50:33 BoogieIcfgContainer [2024-11-06 18:50:33,291 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:50:33,292 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:50:33,292 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:50:33,292 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:50:33,292 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:50:05" (3/4) ... [2024-11-06 18:50:33,294 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-06 18:50:33,295 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:50:33,296 INFO L158 Benchmark]: Toolchain (without parser) took 28427.80ms. Allocated memory was 100.7MB in the beginning and 243.3MB in the end (delta: 142.6MB). Free memory was 76.6MB in the beginning and 170.6MB in the end (delta: -93.9MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2024-11-06 18:50:33,296 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:50:33,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.50ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 62.5MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 18:50:33,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.50ms. Allocated memory is still 100.7MB. Free memory was 62.5MB in the beginning and 60.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:50:33,296 INFO L158 Benchmark]: Boogie Preprocessor took 56.60ms. Allocated memory is still 100.7MB. Free memory was 60.6MB in the beginning and 58.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:50:33,296 INFO L158 Benchmark]: RCFGBuilder took 685.94ms. Allocated memory is still 100.7MB. Free memory was 58.7MB in the beginning and 75.4MB in the end (delta: -16.6MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-11-06 18:50:33,297 INFO L158 Benchmark]: TraceAbstraction took 27316.96ms. Allocated memory was 100.7MB in the beginning and 243.3MB in the end (delta: 142.6MB). Free memory was 74.5MB in the beginning and 173.3MB in the end (delta: -98.8MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2024-11-06 18:50:33,297 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 243.3MB. Free memory was 173.3MB in the beginning and 170.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:50:33,300 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.21ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.50ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 62.5MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.50ms. Allocated memory is still 100.7MB. Free memory was 62.5MB in the beginning and 60.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.60ms. Allocated memory is still 100.7MB. Free memory was 60.6MB in the beginning and 58.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 685.94ms. Allocated memory is still 100.7MB. Free memory was 58.7MB in the beginning and 75.4MB in the end (delta: -16.6MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * TraceAbstraction took 27316.96ms. Allocated memory was 100.7MB in the beginning and 243.3MB in the end (delta: 142.6MB). Free memory was 74.5MB in the beginning and 173.3MB in the end (delta: -98.8MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 243.3MB. Free memory was 173.3MB in the beginning and 170.6MB in the end (delta: 2.7MB). 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: 17]: 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 bitwiseOr at line 110, overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=-127, eb=127] [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L251] RET, EXPR base2flt(0, 0) VAL [ea=-127, eb=127] [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-127, \old(m)=33554431] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=33554431, e=-127] [L76] m = m & ~ (1U << 24U) [L77] EXPR m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-127, \old(m)=33554431] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=33554431, __retres4=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m)=33554431, \result=16777216] [L252] RET, EXPR base2flt(ma, ea) VAL [ea=-127, eb=127, ma=33554431, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m)=33554432] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L253] RET, EXPR base2flt(mb, eb) VAL [a=16777216, ea=-127, eb=127, ma=33554431, mb=33554432, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, tmp=1, zero=0] [L263] sa = tmp VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, sa=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, sa=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, sa=1, tmp___0=1] [L273] sb = tmp___0 VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, sa=1, sb=1] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [a=16777216, b=4294967295] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [a=4294967295, b=16777216] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 VAL [a=4294967295, b=16777216, ea=127, ma=16777215] [L110] EXPR ma | (1U << 24U) VAL [a=4294967295, b=16777216, ea=127] [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 VAL [a=4294967295, ea=127, eb=-127, ma=16777216, mb=0] [L113] EXPR mb | (1U << 24U) VAL [a=4294967295, ea=127, eb=-127, ma=16777216] [L113] mb = mb | (1U << 24U) [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [a=4294967295, ea=127, eb=-127, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [a=4294967295, delta=254, ea=127, ma=16777216, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.2s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2326 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2199 mSDsluCounter, 28090 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23205 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5701 IncrementalHoareTripleChecker+Invalid, 5850 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 4885 mSDtfsCounter, 5701 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1505 GetRequests, 1181 SyntacticMatches, 3 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1012occurred in iteration=20, InterpolantAutomatonStates: 253, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 2590 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 14.3s InterpolantComputationTime, 2348 NumberOfCodeBlocks, 2348 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2536 ConstructedInterpolants, 15 QuantifiedInterpolants, 6851 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2095 ConjunctsInSsa, 231 ConjunctsInUnsatCore, 53 InterpolantComputations, 29 PerfectInterpolantSequences, 792/879 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-06 18:50:33,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c -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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:50:35,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:50:35,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-06 18:50:35,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:50:35,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:50:35,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:50:35,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:50:35,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:50:35,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:50:35,597 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:50:35,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:50:35,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:50:35,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:50:35,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:50:35,598 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:50:35,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:50:35,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:50:35,598 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:50:35,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:50:35,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:50:35,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:50:35,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:50:35,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:50:35,599 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 18:50:35,599 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 18:50:35,599 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:50:35,599 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 18:50:35,599 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:50:35,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:50:35,600 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:50:35,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:50:35,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:50:35,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:50:35,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:50:35,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:50:35,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:50:35,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:50:35,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:50:35,601 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 18:50:35,601 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 18:50:35,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:50:35,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:50:35,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:50:35,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:50:35,601 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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2024-11-06 18:50:35,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:50:35,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:50:35,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:50:35,900 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:50:35,901 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:50:35,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-11-06 18:50:37,243 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:50:37,461 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:50:37,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-11-06 18:50:37,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c62446c14/56d2358595ca440cbd97e11fc785cd48/FLAG559b8fb22 [2024-11-06 18:50:37,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c62446c14/56d2358595ca440cbd97e11fc785cd48 [2024-11-06 18:50:37,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:50:37,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:50:37,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:50:37,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:50:37,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:50:37,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:50:37" (1/1) ... [2024-11-06 18:50:37,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ee20d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:37, skipping insertion in model container [2024-11-06 18:50:37,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:50:37" (1/1) ... [2024-11-06 18:50:37,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:50:37,958 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/bitvector/soft_float_1-3a.c.cil.c[730,743] [2024-11-06 18:50:38,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:50:38,023 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:50:38,031 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2024-11-06 18:50:38,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:50:38,073 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:50:38,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:38 WrapperNode [2024-11-06 18:50:38,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:50:38,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:50:38,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:50:38,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:50:38,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:38" (1/1) ... [2024-11-06 18:50:38,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:38" (1/1) ... [2024-11-06 18:50:38,116 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 148 [2024-11-06 18:50:38,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:50:38,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:50:38,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:50:38,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:50:38,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:38" (1/1) ... [2024-11-06 18:50:38,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:38" (1/1) ... [2024-11-06 18:50:38,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:38" (1/1) ... [2024-11-06 18:50:38,140 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-06 18:50:38,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:38" (1/1) ... [2024-11-06 18:50:38,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:38" (1/1) ... [2024-11-06 18:50:38,146 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:38" (1/1) ... [2024-11-06 18:50:38,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:38" (1/1) ... [2024-11-06 18:50:38,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:38" (1/1) ... [2024-11-06 18:50:38,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:38" (1/1) ... [2024-11-06 18:50:38,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:50:38,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:50:38,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:50:38,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:50:38,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:38" (1/1) ... [2024-11-06 18:50:38,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:50:38,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:38,204 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-06 18:50:38,207 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-06 18:50:38,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:50:38,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 18:50:38,233 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-06 18:50:38,233 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-06 18:50:38,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:50:38,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:50:38,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 18:50:38,233 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 18:50:38,307 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:50:38,309 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:50:38,685 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-06 18:50:38,685 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:50:38,702 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:50:38,703 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 18:50:38,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:50:38 BoogieIcfgContainer [2024-11-06 18:50:38,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:50:38,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:50:38,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:50:38,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:50:38,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:50:37" (1/3) ... [2024-11-06 18:50:38,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9a2194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:50:38, skipping insertion in model container [2024-11-06 18:50:38,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:38" (2/3) ... [2024-11-06 18:50:38,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9a2194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:50:38, skipping insertion in model container [2024-11-06 18:50:38,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:50:38" (3/3) ... [2024-11-06 18:50:38,716 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2024-11-06 18:50:38,747 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:50:38,747 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:50:38,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:50:38,807 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;@63aaf10e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:50:38,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:50:38,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 62 states have internal predecessors, (94), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-06 18:50:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-06 18:50:38,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:38,821 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:38,821 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:38,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:38,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1607439287, now seen corresponding path program 1 times [2024-11-06 18:50:38,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:38,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286409091] [2024-11-06 18:50:38,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:38,836 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-06 18:50:38,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:38,840 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-06 18:50:38,842 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-06 18:50:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:38,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 18:50:38,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:39,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:39,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:39,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286409091] [2024-11-06 18:50:39,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286409091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:39,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:50:39,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-06 18:50:39,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50894979] [2024-11-06 18:50:39,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:39,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:39,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:39,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:39,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:39,130 INFO L87 Difference]: Start difference. First operand has 72 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 62 states have internal predecessors, (94), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:39,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:39,242 INFO L93 Difference]: Finished difference Result 154 states and 254 transitions. [2024-11-06 18:50:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:39,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-11-06 18:50:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:39,253 INFO L225 Difference]: With dead ends: 154 [2024-11-06 18:50:39,253 INFO L226 Difference]: Without dead ends: 81 [2024-11-06 18:50:39,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:39,261 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 5 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:39,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 496 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-06 18:50:39,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2024-11-06 18:50:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 67 states have internal predecessors, (95), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2024-11-06 18:50:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2024-11-06 18:50:39,308 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 32 [2024-11-06 18:50:39,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:39,309 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2024-11-06 18:50:39,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:39,309 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2024-11-06 18:50:39,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-06 18:50:39,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:39,312 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-06 18:50:39,315 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-06 18:50:39,513 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-06 18:50:39,513 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:39,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:39,514 INFO L85 PathProgramCache]: Analyzing trace with hash 861184615, now seen corresponding path program 1 times [2024-11-06 18:50:39,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:39,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316218916] [2024-11-06 18:50:39,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:39,515 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-06 18:50:39,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:39,519 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-06 18:50:39,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-06 18:50:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:39,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 18:50:39,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:39,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:39,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:39,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316218916] [2024-11-06 18:50:39,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316218916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:39,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:39,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:50:39,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47738038] [2024-11-06 18:50:39,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:39,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:39,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:39,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:39,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:39,671 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:39,806 INFO L93 Difference]: Finished difference Result 167 states and 257 transitions. [2024-11-06 18:50:39,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:39,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-06 18:50:39,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:39,809 INFO L225 Difference]: With dead ends: 167 [2024-11-06 18:50:39,809 INFO L226 Difference]: Without dead ends: 125 [2024-11-06 18:50:39,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:39,810 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 45 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:39,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 440 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:39,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-06 18:50:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-11-06 18:50:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.4660194174757282) internal successors, (151), 104 states have internal predecessors, (151), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (20), 18 states have call predecessors, (20), 15 states have call successors, (20) [2024-11-06 18:50:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 187 transitions. [2024-11-06 18:50:39,835 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 187 transitions. Word has length 36 [2024-11-06 18:50:39,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:39,835 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 187 transitions. [2024-11-06 18:50:39,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 187 transitions. [2024-11-06 18:50:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-06 18:50:39,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:39,838 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-06 18:50:39,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:40,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:40,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:40,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:40,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1541242985, now seen corresponding path program 1 times [2024-11-06 18:50:40,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:40,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748671150] [2024-11-06 18:50:40,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:40,040 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-06 18:50:40,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:40,042 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:40,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-06 18:50:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:40,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 18:50:40,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:40,156 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:40,156 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:40,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:40,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748671150] [2024-11-06 18:50:40,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748671150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:40,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:40,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 18:50:40,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030289797] [2024-11-06 18:50:40,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:40,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 18:50:40,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:40,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 18:50:40,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:40,157 INFO L87 Difference]: Start difference. First operand 123 states and 187 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:40,271 INFO L93 Difference]: Finished difference Result 155 states and 233 transitions. [2024-11-06 18:50:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 18:50:40,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-06 18:50:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:40,273 INFO L225 Difference]: With dead ends: 155 [2024-11-06 18:50:40,273 INFO L226 Difference]: Without dead ends: 116 [2024-11-06 18:50:40,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:50:40,274 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 33 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:40,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 517 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-06 18:50:40,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-06 18:50:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (17), 15 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-06 18:50:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 170 transitions. [2024-11-06 18:50:40,293 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 170 transitions. Word has length 36 [2024-11-06 18:50:40,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:40,294 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 170 transitions. [2024-11-06 18:50:40,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:40,294 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 170 transitions. [2024-11-06 18:50:40,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 18:50:40,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:40,295 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 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-06 18:50:40,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-06 18:50:40,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:40,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:40,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:40,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1860643154, now seen corresponding path program 1 times [2024-11-06 18:50:40,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:40,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001695952] [2024-11-06 18:50:40,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:40,497 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-06 18:50:40,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:40,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:40,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-06 18:50:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:40,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 18:50:40,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:40,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:40,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:40,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001695952] [2024-11-06 18:50:40,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001695952] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:40,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:50:40,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-06 18:50:40,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037807855] [2024-11-06 18:50:40,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:40,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 18:50:40,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:40,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 18:50:40,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:50:40,707 INFO L87 Difference]: Start difference. First operand 114 states and 170 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:40,861 INFO L93 Difference]: Finished difference Result 256 states and 385 transitions. [2024-11-06 18:50:40,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 18:50:40,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-06 18:50:40,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:40,863 INFO L225 Difference]: With dead ends: 256 [2024-11-06 18:50:40,863 INFO L226 Difference]: Without dead ends: 181 [2024-11-06 18:50:40,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-06 18:50:40,865 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 28 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:40,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 597 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-06 18:50:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2024-11-06 18:50:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 154 states have internal predecessors, (215), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (25), 25 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-06 18:50:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 259 transitions. [2024-11-06 18:50:40,891 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 259 transitions. Word has length 40 [2024-11-06 18:50:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:40,892 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 259 transitions. [2024-11-06 18:50:40,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 259 transitions. [2024-11-06 18:50:40,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-06 18:50:40,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:40,897 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:40,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-06 18:50:41,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:41,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:41,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:41,098 INFO L85 PathProgramCache]: Analyzing trace with hash 339137576, now seen corresponding path program 1 times [2024-11-06 18:50:41,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:41,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230275430] [2024-11-06 18:50:41,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:41,098 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-06 18:50:41,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:41,100 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:41,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-06 18:50:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:41,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:50:41,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:41,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:41,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:41,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230275430] [2024-11-06 18:50:41,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230275430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:41,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:41,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:41,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263407366] [2024-11-06 18:50:41,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:41,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:41,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:41,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:41,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:41,181 INFO L87 Difference]: Start difference. First operand 178 states and 259 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:41,205 INFO L93 Difference]: Finished difference Result 299 states and 439 transitions. [2024-11-06 18:50:41,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:41,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-06 18:50:41,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:41,208 INFO L225 Difference]: With dead ends: 299 [2024-11-06 18:50:41,208 INFO L226 Difference]: Without dead ends: 233 [2024-11-06 18:50:41,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:41,209 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 14 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:41,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 328 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:41,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-06 18:50:41,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-06 18:50:41,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 207 states have (on average 1.3478260869565217) internal successors, (279), 206 states have internal predecessors, (279), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2024-11-06 18:50:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 329 transitions. [2024-11-06 18:50:41,231 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 329 transitions. Word has length 43 [2024-11-06 18:50:41,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:41,232 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 329 transitions. [2024-11-06 18:50:41,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 329 transitions. [2024-11-06 18:50:41,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-06 18:50:41,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:41,233 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:41,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-06 18:50:41,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:41,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:41,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:41,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1682069059, now seen corresponding path program 1 times [2024-11-06 18:50:41,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:41,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962321862] [2024-11-06 18:50:41,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:41,435 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-06 18:50:41,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:41,437 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:41,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-06 18:50:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:41,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:50:41,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 18:50:41,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:41,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:41,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962321862] [2024-11-06 18:50:41,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962321862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:41,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:41,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:41,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763699906] [2024-11-06 18:50:41,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:41,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:41,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:41,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:41,515 INFO L87 Difference]: Start difference. First operand 233 states and 329 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:41,573 INFO L93 Difference]: Finished difference Result 408 states and 573 transitions. [2024-11-06 18:50:41,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 18:50:41,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-06 18:50:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:41,576 INFO L225 Difference]: With dead ends: 408 [2024-11-06 18:50:41,577 INFO L226 Difference]: Without dead ends: 178 [2024-11-06 18:50:41,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:50:41,579 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 26 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:41,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 261 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:41,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-06 18:50:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2024-11-06 18:50:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 146 states have (on average 1.3082191780821917) internal successors, (191), 148 states have internal predecessors, (191), 15 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (20), 17 states have call predecessors, (20), 14 states have call successors, (20) [2024-11-06 18:50:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 226 transitions. [2024-11-06 18:50:41,598 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 226 transitions. Word has length 43 [2024-11-06 18:50:41,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:41,598 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 226 transitions. [2024-11-06 18:50:41,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 226 transitions. [2024-11-06 18:50:41,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 18:50:41,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:41,600 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:41,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-06 18:50:41,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:41,803 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:41,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:41,803 INFO L85 PathProgramCache]: Analyzing trace with hash -690232792, now seen corresponding path program 1 times [2024-11-06 18:50:41,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:41,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003996344] [2024-11-06 18:50:41,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:41,804 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-06 18:50:41,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:41,806 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:41,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-06 18:50:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:41,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 18:50:41,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:41,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:42,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:42,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003996344] [2024-11-06 18:50:42,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003996344] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:42,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:42,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-11-06 18:50:42,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443273606] [2024-11-06 18:50:42,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:42,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:42,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:42,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:42,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:50:42,082 INFO L87 Difference]: Start difference. First operand 166 states and 226 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:42,270 INFO L93 Difference]: Finished difference Result 252 states and 354 transitions. [2024-11-06 18:50:42,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:42,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-06 18:50:42,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:42,273 INFO L225 Difference]: With dead ends: 252 [2024-11-06 18:50:42,273 INFO L226 Difference]: Without dead ends: 216 [2024-11-06 18:50:42,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:50:42,274 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 24 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:42,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 433 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:50:42,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-06 18:50:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 204. [2024-11-06 18:50:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 178 states have (on average 1.303370786516854) internal successors, (232), 181 states have internal predecessors, (232), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2024-11-06 18:50:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 279 transitions. [2024-11-06 18:50:42,287 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 279 transitions. Word has length 44 [2024-11-06 18:50:42,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:42,287 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 279 transitions. [2024-11-06 18:50:42,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 279 transitions. [2024-11-06 18:50:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 18:50:42,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:42,296 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:42,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:42,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:42,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:42,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:42,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1084774570, now seen corresponding path program 1 times [2024-11-06 18:50:42,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:42,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111436226] [2024-11-06 18:50:42,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:42,498 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-06 18:50:42,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:42,503 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:42,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-06 18:50:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:42,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 18:50:42,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:42,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:42,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:42,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111436226] [2024-11-06 18:50:42,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111436226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:42,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:42,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 18:50:42,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364487263] [2024-11-06 18:50:42,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:42,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 18:50:42,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:42,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 18:50:42,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:50:42,577 INFO L87 Difference]: Start difference. First operand 204 states and 279 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:42,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:42,614 INFO L93 Difference]: Finished difference Result 211 states and 285 transitions. [2024-11-06 18:50:42,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 18:50:42,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-06 18:50:42,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:42,616 INFO L225 Difference]: With dead ends: 211 [2024-11-06 18:50:42,616 INFO L226 Difference]: Without dead ends: 204 [2024-11-06 18:50:42,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:42,617 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 3 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:42,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 382 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:42,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-06 18:50:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-06 18:50:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 178 states have (on average 1.2865168539325842) internal successors, (229), 181 states have internal predecessors, (229), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2024-11-06 18:50:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 276 transitions. [2024-11-06 18:50:42,629 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 276 transitions. Word has length 44 [2024-11-06 18:50:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:42,629 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 276 transitions. [2024-11-06 18:50:42,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 276 transitions. [2024-11-06 18:50:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 18:50:42,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:42,631 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 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-06 18:50:42,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-06 18:50:42,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:42,832 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:42,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:42,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1077808761, now seen corresponding path program 2 times [2024-11-06 18:50:42,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:42,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38171605] [2024-11-06 18:50:42,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 18:50:42,832 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-06 18:50:42,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:42,834 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:42,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-06 18:50:42,875 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 18:50:42,875 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:50:42,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 18:50:42,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:42,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:42,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:42,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38171605] [2024-11-06 18:50:42,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38171605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:42,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:42,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:50:42,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442782462] [2024-11-06 18:50:42,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:42,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:42,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:42,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:42,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:42,986 INFO L87 Difference]: Start difference. First operand 204 states and 276 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:43,079 INFO L93 Difference]: Finished difference Result 210 states and 281 transitions. [2024-11-06 18:50:43,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:43,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-06 18:50:43,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:43,081 INFO L225 Difference]: With dead ends: 210 [2024-11-06 18:50:43,081 INFO L226 Difference]: Without dead ends: 208 [2024-11-06 18:50:43,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:43,082 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 3 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:43,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 459 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-06 18:50:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-06 18:50:43,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.281767955801105) internal successors, (232), 184 states have internal predecessors, (232), 21 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2024-11-06 18:50:43,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 279 transitions. [2024-11-06 18:50:43,097 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 279 transitions. Word has length 44 [2024-11-06 18:50:43,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:43,097 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 279 transitions. [2024-11-06 18:50:43,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 279 transitions. [2024-11-06 18:50:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 18:50:43,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:43,099 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 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-06 18:50:43,102 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 (10)] Ended with exit code 0 [2024-11-06 18:50:43,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:43,300 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:43,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:43,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1020550459, now seen corresponding path program 1 times [2024-11-06 18:50:43,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:43,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378246119] [2024-11-06 18:50:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:43,300 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-06 18:50:43,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:43,302 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:43,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-06 18:50:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:43,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-06 18:50:43,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:43,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:43,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:43,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378246119] [2024-11-06 18:50:43,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378246119] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:43,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:43,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-11-06 18:50:43,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351340734] [2024-11-06 18:50:43,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:43,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:43,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:43,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:43,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-06 18:50:43,666 INFO L87 Difference]: Start difference. First operand 208 states and 279 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:43,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:43,739 INFO L93 Difference]: Finished difference Result 214 states and 284 transitions. [2024-11-06 18:50:43,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:43,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-06 18:50:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:43,741 INFO L225 Difference]: With dead ends: 214 [2024-11-06 18:50:43,741 INFO L226 Difference]: Without dead ends: 212 [2024-11-06 18:50:43,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-06 18:50:43,745 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:43,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 454 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:43,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-06 18:50:43,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-06 18:50:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 184 states have (on average 1.2771739130434783) internal successors, (235), 187 states have internal predecessors, (235), 21 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2024-11-06 18:50:43,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 282 transitions. [2024-11-06 18:50:43,759 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 282 transitions. Word has length 44 [2024-11-06 18:50:43,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:43,760 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 282 transitions. [2024-11-06 18:50:43,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 282 transitions. [2024-11-06 18:50:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-06 18:50:43,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:43,762 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:43,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-06 18:50:43,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:43,962 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:43,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:43,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1134786859, now seen corresponding path program 1 times [2024-11-06 18:50:43,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:43,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535168930] [2024-11-06 18:50:43,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:43,963 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-06 18:50:43,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:43,965 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:43,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-06 18:50:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:44,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:50:44,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:44,040 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:44,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:44,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535168930] [2024-11-06 18:50:44,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535168930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:44,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:44,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:44,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77057013] [2024-11-06 18:50:44,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:44,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:44,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:44,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:44,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:44,041 INFO L87 Difference]: Start difference. First operand 212 states and 282 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:44,063 INFO L93 Difference]: Finished difference Result 345 states and 471 transitions. [2024-11-06 18:50:44,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:44,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-11-06 18:50:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:44,065 INFO L225 Difference]: With dead ends: 345 [2024-11-06 18:50:44,065 INFO L226 Difference]: Without dead ends: 293 [2024-11-06 18:50:44,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:44,066 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 27 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:44,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 321 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-06 18:50:44,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 231. [2024-11-06 18:50:44,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 200 states have (on average 1.285) internal successors, (257), 202 states have internal predecessors, (257), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (29), 26 states have call predecessors, (29), 23 states have call successors, (29) [2024-11-06 18:50:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 310 transitions. [2024-11-06 18:50:44,080 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 310 transitions. Word has length 45 [2024-11-06 18:50:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:44,081 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 310 transitions. [2024-11-06 18:50:44,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 310 transitions. [2024-11-06 18:50:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 18:50:44,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:44,082 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:44,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-06 18:50:44,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:44,284 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:44,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:44,284 INFO L85 PathProgramCache]: Analyzing trace with hash 702695573, now seen corresponding path program 1 times [2024-11-06 18:50:44,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:44,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611208074] [2024-11-06 18:50:44,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:44,285 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-06 18:50:44,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:44,287 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:44,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-06 18:50:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:44,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:50:44,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:44,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:44,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:44,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611208074] [2024-11-06 18:50:44,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611208074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:44,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:44,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:44,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059878221] [2024-11-06 18:50:44,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:44,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:44,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:44,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:44,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:44,349 INFO L87 Difference]: Start difference. First operand 231 states and 310 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:44,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:44,365 INFO L93 Difference]: Finished difference Result 246 states and 326 transitions. [2024-11-06 18:50:44,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:44,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-06 18:50:44,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:44,367 INFO L225 Difference]: With dead ends: 246 [2024-11-06 18:50:44,367 INFO L226 Difference]: Without dead ends: 207 [2024-11-06 18:50:44,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:44,368 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:44,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-06 18:50:44,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-06 18:50:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 176 states have (on average 1.3011363636363635) internal successors, (229), 179 states have internal predecessors, (229), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (27), 25 states have call predecessors, (27), 23 states have call successors, (27) [2024-11-06 18:50:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 280 transitions. [2024-11-06 18:50:44,378 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 280 transitions. Word has length 48 [2024-11-06 18:50:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:44,378 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 280 transitions. [2024-11-06 18:50:44,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 280 transitions. [2024-11-06 18:50:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-06 18:50:44,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:44,379 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-06 18:50:44,382 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 (13)] Ended with exit code 0 [2024-11-06 18:50:44,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-06 18:50:44,583 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:44,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:44,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1948634931, now seen corresponding path program 1 times [2024-11-06 18:50:44,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:44,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025154468] [2024-11-06 18:50:44,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:44,583 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-06 18:50:44,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:44,585 INFO L229 MonitoredProcess]: Starting monitored process 14 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-06 18:50:44,586 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 (14)] Waiting until timeout for monitored process [2024-11-06 18:50:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:44,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 18:50:44,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:44,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:44,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:44,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025154468] [2024-11-06 18:50:44,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025154468] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:44,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:50:44,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-06 18:50:44,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340596552] [2024-11-06 18:50:44,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:44,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 18:50:44,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:44,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 18:50:44,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:50:44,801 INFO L87 Difference]: Start difference. First operand 207 states and 280 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:50:44,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:44,951 INFO L93 Difference]: Finished difference Result 245 states and 319 transitions. [2024-11-06 18:50:44,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 18:50:44,952 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2024-11-06 18:50:44,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:44,954 INFO L225 Difference]: With dead ends: 245 [2024-11-06 18:50:44,954 INFO L226 Difference]: Without dead ends: 179 [2024-11-06 18:50:44,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-06 18:50:44,955 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 17 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:44,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 649 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:44,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-06 18:50:44,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2024-11-06 18:50:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 143 states have internal predecessors, (184), 19 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (22), 20 states have call predecessors, (22), 18 states have call successors, (22) [2024-11-06 18:50:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 225 transitions. [2024-11-06 18:50:44,963 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 225 transitions. Word has length 50 [2024-11-06 18:50:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:44,964 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 225 transitions. [2024-11-06 18:50:44,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:50:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 225 transitions. [2024-11-06 18:50:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 18:50:44,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:44,965 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-06 18:50:44,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:45,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-06 18:50:45,168 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:45,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1060673824, now seen corresponding path program 1 times [2024-11-06 18:50:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:45,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833639992] [2024-11-06 18:50:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:45,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:45,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:45,171 INFO L229 MonitoredProcess]: Starting monitored process 15 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-06 18:50:45,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-06 18:50:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:45,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 18:50:45,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:45,248 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:45,248 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:45,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:45,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833639992] [2024-11-06 18:50:45,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833639992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:45,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:45,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 18:50:45,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279495332] [2024-11-06 18:50:45,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:45,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 18:50:45,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:45,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 18:50:45,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:50:45,249 INFO L87 Difference]: Start difference. First operand 166 states and 225 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:45,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:45,337 INFO L93 Difference]: Finished difference Result 213 states and 289 transitions. [2024-11-06 18:50:45,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:45,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-06 18:50:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:45,340 INFO L225 Difference]: With dead ends: 213 [2024-11-06 18:50:45,340 INFO L226 Difference]: Without dead ends: 171 [2024-11-06 18:50:45,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:45,341 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 48 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:45,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 331 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-06 18:50:45,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 166. [2024-11-06 18:50:45,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.3) internal successors, (182), 143 states have internal predecessors, (182), 19 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (22), 20 states have call predecessors, (22), 18 states have call successors, (22) [2024-11-06 18:50:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 223 transitions. [2024-11-06 18:50:45,351 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 223 transitions. Word has length 49 [2024-11-06 18:50:45,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:45,351 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 223 transitions. [2024-11-06 18:50:45,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:45,351 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 223 transitions. [2024-11-06 18:50:45,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-06 18:50:45,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:45,352 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-06 18:50:45,356 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 (15)] Ended with exit code 0 [2024-11-06 18:50:45,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-06 18:50:45,553 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:45,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:45,553 INFO L85 PathProgramCache]: Analyzing trace with hash 45509775, now seen corresponding path program 1 times [2024-11-06 18:50:45,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:45,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628167074] [2024-11-06 18:50:45,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:45,554 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-06 18:50:45,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:45,556 INFO L229 MonitoredProcess]: Starting monitored process 16 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-06 18:50:45,557 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 (16)] Waiting until timeout for monitored process [2024-11-06 18:50:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 18:50:45,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 18:50:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 18:50:45,668 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-06 18:50:45,669 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 18:50:45,669 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:50:45,674 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 (16)] Ended with exit code 0 [2024-11-06 18:50:45,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-06 18:50:45,873 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:45,898 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:50:45,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:50:45 BoogieIcfgContainer [2024-11-06 18:50:45,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:50:45,900 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:50:45,900 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:50:45,901 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:50:45,901 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:50:38" (3/4) ... [2024-11-06 18:50:45,902 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-06 18:50:45,952 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 18:50:45,953 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:50:45,953 INFO L158 Benchmark]: Toolchain (without parser) took 8140.93ms. Allocated memory is still 83.9MB. Free memory was 60.2MB in the beginning and 51.3MB in the end (delta: 8.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-06 18:50:45,953 INFO L158 Benchmark]: CDTParser took 1.01ms. Allocated memory is still 83.9MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:50:45,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.51ms. Allocated memory is still 83.9MB. Free memory was 60.2MB in the beginning and 45.8MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 18:50:45,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.49ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 43.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:50:45,954 INFO L158 Benchmark]: Boogie Preprocessor took 36.85ms. Allocated memory is still 83.9MB. Free memory was 43.9MB in the beginning and 42.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:50:45,954 INFO L158 Benchmark]: RCFGBuilder took 547.10ms. Allocated memory is still 83.9MB. Free memory was 42.0MB in the beginning and 24.0MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 18:50:45,954 INFO L158 Benchmark]: TraceAbstraction took 7193.21ms. Allocated memory is still 83.9MB. Free memory was 23.4MB in the beginning and 54.5MB in the end (delta: -31.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-06 18:50:45,954 INFO L158 Benchmark]: Witness Printer took 52.30ms. Allocated memory is still 83.9MB. Free memory was 54.5MB in the beginning and 51.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:50:45,956 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.01ms. Allocated memory is still 83.9MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.51ms. Allocated memory is still 83.9MB. Free memory was 60.2MB in the beginning and 45.8MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.49ms. Allocated memory is still 83.9MB. Free memory was 45.5MB in the beginning and 43.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.85ms. Allocated memory is still 83.9MB. Free memory was 43.9MB in the beginning and 42.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 547.10ms. Allocated memory is still 83.9MB. Free memory was 42.0MB in the beginning and 24.0MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7193.21ms. Allocated memory is still 83.9MB. Free memory was 23.4MB in the beginning and 54.5MB in the end (delta: -31.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 52.30ms. Allocated memory is still 83.9MB. Free memory was 54.5MB in the beginning and 51.3MB in the end (delta: 3.2MB). 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L251] RET, EXPR base2flt(0, 0) [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=-2147483648] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-2147483648] [L252] RET, EXPR base2flt(ma, ea) VAL [ea=0, ma=16777216, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=64, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=64, \old(m)=16777216, __retres4=-1073741824] [L80] return (__retres4); VAL [\old(e)=64, \old(m)=16777216, \result=-1073741824] [L253] RET, EXPR base2flt(mb, eb) VAL [a=-2147483648, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, tmp=1, zero=0] [L263] sa = tmp VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp___0=1] [L273] sb = tmp___0 VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, sb=1] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [a=-2147483648, b=-1073741824] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [a=-1073741824, b=-2147483648] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) VAL [a=-1073741824, ea=64, eb=0, ma=16777216, mb=16777216] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [a=-1073741824, ea=64, eb=0, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [a=-1073741824, delta=64, ea=64, ma=16777216, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 300 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 276 mSDsluCounter, 5953 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4591 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 825 IncrementalHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 1362 mSDtfsCounter, 825 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 803 GetRequests, 717 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=5, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 112 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 648 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 789 ConstructedInterpolants, 2 QuantifiedInterpolants, 1316 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1111 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 274/313 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 proved your program to be incorrect! [2024-11-06 18:50:45,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE