./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.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/nla-digbench-scaling/egcd-ll_unwindbound50.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', '2d26d8e14d33b8c29eaf9ffa7603dd26966f962451e6c0726b154a73bf65f3d2'] 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/nla-digbench-scaling/egcd-ll_unwindbound50.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 2d26d8e14d33b8c29eaf9ffa7603dd26966f962451e6c0726b154a73bf65f3d2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 22:54:28,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 22:54:28,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 22:54:28,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 22:54:28,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 22:54:28,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 22:54:28,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 22:54:28,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 22:54:28,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 22:54:28,532 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 22:54:28,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 22:54:28,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 22:54:28,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 22:54:28,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 22:54:28,533 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 22:54:28,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 22:54:28,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 22:54:28,533 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 22:54:28,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 22:54:28,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 22:54:28,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 22:54:28,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 22:54:28,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 22:54:28,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 22:54:28,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 22:54:28,535 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 22:54:28,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 22:54:28,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 22:54:28,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 22:54:28,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 22:54:28,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 22:54:28,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 22:54:28,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:54:28,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 22:54:28,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 22:54:28,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 22:54:28,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 22:54:28,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 22:54:28,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 22:54:28,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 22:54:28,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 22:54:28,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 22:54:28,536 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 -> 2d26d8e14d33b8c29eaf9ffa7603dd26966f962451e6c0726b154a73bf65f3d2 [2024-11-06 22:54:28,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 22:54:28,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 22:54:28,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 22:54:28,811 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 22:54:28,812 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 22:54:28,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2024-11-06 22:54:30,115 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 22:54:30,314 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 22:54:30,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2024-11-06 22:54:30,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0e1f5781/43fe2a36ac754c9ead32578bd01acbbb/FLAG881557c37 [2024-11-06 22:54:30,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0e1f5781/43fe2a36ac754c9ead32578bd01acbbb [2024-11-06 22:54:30,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 22:54:30,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 22:54:30,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 22:54:30,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 22:54:30,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 22:54:30,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:54:30" (1/1) ... [2024-11-06 22:54:30,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca0651f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:30, skipping insertion in model container [2024-11-06 22:54:30,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:54:30" (1/1) ... [2024-11-06 22:54:30,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 22:54:30,498 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/nla-digbench-scaling/egcd-ll_unwindbound50.c[489,502] [2024-11-06 22:54:30,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:54:30,533 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 22:54:30,542 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/nla-digbench-scaling/egcd-ll_unwindbound50.c[489,502] [2024-11-06 22:54:30,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:54:30,565 INFO L204 MainTranslator]: Completed translation [2024-11-06 22:54:30,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:30 WrapperNode [2024-11-06 22:54:30,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 22:54:30,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 22:54:30,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 22:54:30,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 22:54:30,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:30" (1/1) ... [2024-11-06 22:54:30,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:30" (1/1) ... [2024-11-06 22:54:30,594 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2024-11-06 22:54:30,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 22:54:30,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 22:54:30,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 22:54:30,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 22:54:30,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:30" (1/1) ... [2024-11-06 22:54:30,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:30" (1/1) ... [2024-11-06 22:54:30,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:30" (1/1) ... [2024-11-06 22:54:30,615 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 22:54:30,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:30" (1/1) ... [2024-11-06 22:54:30,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:30" (1/1) ... [2024-11-06 22:54:30,620 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:30" (1/1) ... [2024-11-06 22:54:30,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:30" (1/1) ... [2024-11-06 22:54:30,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:30" (1/1) ... [2024-11-06 22:54:30,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:30" (1/1) ... [2024-11-06 22:54:30,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 22:54:30,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 22:54:30,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 22:54:30,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 22:54:30,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:30" (1/1) ... [2024-11-06 22:54:30,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:54:30,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:54:30,662 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 22:54:30,665 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 22:54:30,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 22:54:30,686 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 22:54:30,686 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 22:54:30,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 22:54:30,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 22:54:30,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 22:54:30,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 22:54:30,686 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 22:54:30,750 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 22:54:30,752 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 22:54:30,906 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-06 22:54:30,906 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 22:54:30,915 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 22:54:30,916 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 22:54:30,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:54:30 BoogieIcfgContainer [2024-11-06 22:54:30,917 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 22:54:30,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 22:54:30,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 22:54:30,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 22:54:30,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:54:30" (1/3) ... [2024-11-06 22:54:30,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3daaac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:54:30, skipping insertion in model container [2024-11-06 22:54:30,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:54:30" (2/3) ... [2024-11-06 22:54:30,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3daaac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:54:30, skipping insertion in model container [2024-11-06 22:54:30,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:54:30" (3/3) ... [2024-11-06 22:54:30,927 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound50.c [2024-11-06 22:54:30,940 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 22:54:30,941 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 22:54:30,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 22:54:31,001 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;@56824580, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 22:54:31,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 22:54:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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 22:54:31,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 22:54:31,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:54:31,012 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:54:31,012 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:54:31,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:54:31,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1165920622, now seen corresponding path program 1 times [2024-11-06 22:54:31,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:54:31,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795896333] [2024-11-06 22:54:31,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:31,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:54:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:31,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:54:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:31,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:54:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:54:31,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:54:31,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795896333] [2024-11-06 22:54:31,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795896333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:54:31,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:54:31,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 22:54:31,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994239707] [2024-11-06 22:54:31,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:54:31,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 22:54:31,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:54:31,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 22:54:31,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 22:54:31,202 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 22:54:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:54:31,223 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2024-11-06 22:54:31,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 22:54:31,225 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-11-06 22:54:31,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:54:31,230 INFO L225 Difference]: With dead ends: 57 [2024-11-06 22:54:31,230 INFO L226 Difference]: Without dead ends: 26 [2024-11-06 22:54:31,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 22:54:31,235 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:54:31,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:54:31,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-06 22:54:31,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-06 22:54:31,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 22:54:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2024-11-06 22:54:31,270 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2024-11-06 22:54:31,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:54:31,271 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-11-06 22:54:31,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 22:54:31,271 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2024-11-06 22:54:31,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 22:54:31,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:54:31,272 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:54:31,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 22:54:31,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:54:31,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:54:31,273 INFO L85 PathProgramCache]: Analyzing trace with hash -542319922, now seen corresponding path program 1 times [2024-11-06 22:54:31,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:54:31,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370373165] [2024-11-06 22:54:31,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:31,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:54:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:31,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:54:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:31,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:54:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:54:31,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:54:31,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370373165] [2024-11-06 22:54:31,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370373165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:54:31,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:54:31,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:54:31,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176298175] [2024-11-06 22:54:31,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:54:31,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:54:31,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:54:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:54:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:54:31,430 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 22:54:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:54:31,452 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2024-11-06 22:54:31,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:54:31,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-06 22:54:31,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:54:31,458 INFO L225 Difference]: With dead ends: 38 [2024-11-06 22:54:31,458 INFO L226 Difference]: Without dead ends: 28 [2024-11-06 22:54:31,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 22:54:31,459 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 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 22:54:31,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:54:31,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-06 22:54:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-06 22:54:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 22:54:31,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2024-11-06 22:54:31,468 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2024-11-06 22:54:31,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:54:31,469 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2024-11-06 22:54:31,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 22:54:31,469 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2024-11-06 22:54:31,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 22:54:31,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:54:31,470 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:54:31,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 22:54:31,471 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:54:31,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:54:31,472 INFO L85 PathProgramCache]: Analyzing trace with hash -540651626, now seen corresponding path program 1 times [2024-11-06 22:54:31,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:54:31,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631106551] [2024-11-06 22:54:31,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:31,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:54:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-06 22:54:31,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2138795709] [2024-11-06 22:54:31,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:31,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:31,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:54:31,512 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 22:54:31,514 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 22:54:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:31,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 22:54:31,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:54:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:54:31,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:54:31,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:54:31,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631106551] [2024-11-06 22:54:31,696 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-06 22:54:31,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138795709] [2024-11-06 22:54:31,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138795709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:54:31,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:54:31,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 22:54:31,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844928805] [2024-11-06 22:54:31,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:54:31,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:54:31,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:54:31,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:54:31,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:54:31,699 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 22:54:31,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:54:31,783 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2024-11-06 22:54:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:54:31,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-06 22:54:31,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:54:31,785 INFO L225 Difference]: With dead ends: 45 [2024-11-06 22:54:31,787 INFO L226 Difference]: Without dead ends: 43 [2024-11-06 22:54:31,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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 22:54:31,788 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:54:31,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 118 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:54:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-06 22:54:31,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-11-06 22:54:31,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-06 22:54:31,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-11-06 22:54:31,804 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2024-11-06 22:54:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:54:31,804 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-11-06 22:54:31,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 22:54:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-11-06 22:54:31,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-06 22:54:31,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:54:31,805 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:54:31,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 22:54:32,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:32,006 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:54:32,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:54:32,007 INFO L85 PathProgramCache]: Analyzing trace with hash -276555716, now seen corresponding path program 1 times [2024-11-06 22:54:32,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:54:32,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543063664] [2024-11-06 22:54:32,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:32,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:54:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-06 22:54:32,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1724841276] [2024-11-06 22:54:32,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:32,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:32,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:54:32,032 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 22:54:32,033 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 22:54:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:32,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 22:54:32,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:54:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:54:32,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:54:32,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:54:32,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543063664] [2024-11-06 22:54:32,179 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-06 22:54:32,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724841276] [2024-11-06 22:54:32,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724841276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:54:32,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:54:32,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 22:54:32,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163919582] [2024-11-06 22:54:32,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:54:32,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:54:32,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:54:32,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:54:32,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:54:32,181 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 22:54:32,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:54:32,260 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2024-11-06 22:54:32,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:54:32,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-11-06 22:54:32,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:54:32,265 INFO L225 Difference]: With dead ends: 49 [2024-11-06 22:54:32,265 INFO L226 Difference]: Without dead ends: 47 [2024-11-06 22:54:32,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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 22:54:32,266 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:54:32,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 132 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:54:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-06 22:54:32,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-11-06 22:54:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-06 22:54:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2024-11-06 22:54:32,278 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 24 [2024-11-06 22:54:32,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:54:32,278 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2024-11-06 22:54:32,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 22:54:32,279 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2024-11-06 22:54:32,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-06 22:54:32,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:54:32,279 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:54:32,294 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 22:54:32,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:32,484 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:54:32,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:54:32,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1836785898, now seen corresponding path program 1 times [2024-11-06 22:54:32,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:54:32,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458487215] [2024-11-06 22:54:32,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:32,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:54:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-06 22:54:32,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2136943634] [2024-11-06 22:54:32,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:32,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:32,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:54:32,516 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 22:54:32,517 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 22:54:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:32,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-06 22:54:32,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:54:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 22:54:32,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:54:32,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:54:32,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458487215] [2024-11-06 22:54:32,644 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-06 22:54:32,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136943634] [2024-11-06 22:54:32,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136943634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:54:32,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:54:32,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 22:54:32,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678323605] [2024-11-06 22:54:32,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:54:32,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:54:32,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:54:32,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:54:32,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:54:32,647 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 22:54:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:54:32,729 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2024-11-06 22:54:32,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:54:32,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-11-06 22:54:32,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:54:32,731 INFO L225 Difference]: With dead ends: 71 [2024-11-06 22:54:32,732 INFO L226 Difference]: Without dead ends: 67 [2024-11-06 22:54:32,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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 22:54:32,733 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:54:32,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 111 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:54:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-06 22:54:32,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-06 22:54:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 39 states have internal predecessors, (47), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-06 22:54:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2024-11-06 22:54:32,747 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 29 [2024-11-06 22:54:32,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:54:32,747 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2024-11-06 22:54:32,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 22:54:32,747 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2024-11-06 22:54:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-06 22:54:32,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:54:32,748 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:54:32,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 22:54:32,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:32,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:54:32,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:54:32,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1071030291, now seen corresponding path program 1 times [2024-11-06 22:54:32,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:54:32,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561505713] [2024-11-06 22:54:32,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:32,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:54:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:33,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:54:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:33,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:54:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:33,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:54:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:33,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:54:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:33,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:54:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:33,105 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:54:33,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:54:33,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561505713] [2024-11-06 22:54:33,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561505713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:54:33,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:54:33,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 22:54:33,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522025098] [2024-11-06 22:54:33,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:54:33,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:54:33,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:54:33,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:54:33,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:54:33,109 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 22:54:33,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:54:33,161 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2024-11-06 22:54:33,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:54:33,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2024-11-06 22:54:33,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:54:33,163 INFO L225 Difference]: With dead ends: 83 [2024-11-06 22:54:33,164 INFO L226 Difference]: Without dead ends: 81 [2024-11-06 22:54:33,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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 22:54:33,165 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:54:33,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 135 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:54:33,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-06 22:54:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2024-11-06 22:54:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 45 states have internal predecessors, (50), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-06 22:54:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2024-11-06 22:54:33,190 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 35 [2024-11-06 22:54:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:54:33,190 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2024-11-06 22:54:33,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 22:54:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2024-11-06 22:54:33,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-06 22:54:33,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:54:33,194 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-11-06 22:54:33,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 22:54:33,194 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:54:33,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:54:33,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1689492770, now seen corresponding path program 1 times [2024-11-06 22:54:33,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:54:33,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138874392] [2024-11-06 22:54:33,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:33,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:54:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:33,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:54:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:33,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:54:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:33,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:54:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:33,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:54:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:33,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:54:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:54:33,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:54:33,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138874392] [2024-11-06 22:54:33,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138874392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:54:33,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983566408] [2024-11-06 22:54:33,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:33,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:33,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:54:33,321 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 22:54:33,322 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 22:54:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:33,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 22:54:33,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:54:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:54:33,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:54:33,516 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:54:33,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983566408] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:54:33,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:54:33,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-06 22:54:33,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384316901] [2024-11-06 22:54:33,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:54:33,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 22:54:33,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:54:33,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 22:54:33,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-06 22:54:33,519 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-06 22:54:33,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:54:33,678 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2024-11-06 22:54:33,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 22:54:33,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 38 [2024-11-06 22:54:33,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:54:33,681 INFO L225 Difference]: With dead ends: 218 [2024-11-06 22:54:33,681 INFO L226 Difference]: Without dead ends: 196 [2024-11-06 22:54:33,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-06 22:54:33,682 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 47 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:54:33,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 156 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:54:33,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-06 22:54:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2024-11-06 22:54:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 119 states have internal predecessors, (132), 61 states have call successors, (61), 21 states have call predecessors, (61), 20 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-06 22:54:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2024-11-06 22:54:33,737 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 38 [2024-11-06 22:54:33,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:54:33,737 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2024-11-06 22:54:33,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-06 22:54:33,738 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2024-11-06 22:54:33,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-06 22:54:33,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:54:33,743 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:54:33,759 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 22:54:33,943 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,SelfDestructingSolverStorable6 [2024-11-06 22:54:33,943 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:54:33,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:54:33,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1691161066, now seen corresponding path program 1 times [2024-11-06 22:54:33,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:54:33,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145586406] [2024-11-06 22:54:33,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:33,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:54:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-06 22:54:33,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1157225589] [2024-11-06 22:54:33,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:33,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:33,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:54:33,961 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 22:54:33,962 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 22:54:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:34,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 22:54:34,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:54:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 22:54:34,107 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:54:34,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:54:34,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145586406] [2024-11-06 22:54:34,108 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-06 22:54:34,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157225589] [2024-11-06 22:54:34,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157225589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:54:34,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:54:34,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 22:54:34,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922915321] [2024-11-06 22:54:34,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:54:34,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:54:34,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:54:34,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:54:34,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:54:34,109 INFO L87 Difference]: Start difference. First operand 190 states and 247 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 22:54:34,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:54:34,174 INFO L93 Difference]: Finished difference Result 204 states and 260 transitions. [2024-11-06 22:54:34,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:54:34,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2024-11-06 22:54:34,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:54:34,176 INFO L225 Difference]: With dead ends: 204 [2024-11-06 22:54:34,179 INFO L226 Difference]: Without dead ends: 199 [2024-11-06 22:54:34,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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 22:54:34,180 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:54:34,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 112 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:54:34,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-06 22:54:34,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-06 22:54:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 117 states have (on average 1.205128205128205) internal successors, (141), 128 states have internal predecessors, (141), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-06 22:54:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2024-11-06 22:54:34,215 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2024-11-06 22:54:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:54:34,216 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2024-11-06 22:54:34,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 22:54:34,217 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2024-11-06 22:54:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 22:54:34,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:54:34,219 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:54:34,235 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 22:54:34,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:34,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:54:34,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:54:34,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1925895455, now seen corresponding path program 1 times [2024-11-06 22:54:34,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:54:34,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857505029] [2024-11-06 22:54:34,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:34,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:54:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:34,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:54:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:34,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:54:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:34,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:54:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:34,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:54:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:34,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:54:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:34,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-06 22:54:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 22:54:34,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:54:34,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857505029] [2024-11-06 22:54:34,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857505029] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:54:34,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704523233] [2024-11-06 22:54:34,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:34,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:34,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:54:34,663 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 22:54:34,664 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 22:54:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:34,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 22:54:34,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:54:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-06 22:54:34,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:54:34,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704523233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:54:34,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 22:54:34,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-06 22:54:34,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232169] [2024-11-06 22:54:34,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:54:34,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 22:54:34,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:54:34,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 22:54:34,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-06 22:54:34,829 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 22:54:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:54:34,941 INFO L93 Difference]: Finished difference Result 230 states and 279 transitions. [2024-11-06 22:54:34,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:54:34,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-11-06 22:54:34,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:54:34,944 INFO L225 Difference]: With dead ends: 230 [2024-11-06 22:54:34,946 INFO L226 Difference]: Without dead ends: 220 [2024-11-06 22:54:34,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-06 22:54:34,948 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:54:34,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 136 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:54:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-06 22:54:34,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2024-11-06 22:54:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 130 states have (on average 1.176923076923077) internal successors, (153), 141 states have internal predecessors, (153), 57 states have call successors, (57), 28 states have call predecessors, (57), 28 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-06 22:54:34,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 261 transitions. [2024-11-06 22:54:34,977 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 261 transitions. Word has length 40 [2024-11-06 22:54:34,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:54:34,977 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 261 transitions. [2024-11-06 22:54:34,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 22:54:34,978 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 261 transitions. [2024-11-06 22:54:34,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-06 22:54:34,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:54:34,980 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:54:34,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-06 22:54:35,184 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,SelfDestructingSolverStorable8 [2024-11-06 22:54:35,185 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:54:35,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:54:35,185 INFO L85 PathProgramCache]: Analyzing trace with hash 968731240, now seen corresponding path program 2 times [2024-11-06 22:54:35,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:54:35,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066606589] [2024-11-06 22:54:35,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:35,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:54:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-06 22:54:35,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [278122573] [2024-11-06 22:54:35,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:54:35,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:35,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:54:35,205 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 22:54:35,210 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 22:54:35,258 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 22:54:35,258 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:54:35,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-06 22:54:35,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:54:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 22:54:35,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:54:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 22:54:36,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:54:36,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066606589] [2024-11-06 22:54:36,220 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-06 22:54:36,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278122573] [2024-11-06 22:54:36,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278122573] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:54:36,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:54:36,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2024-11-06 22:54:36,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734605523] [2024-11-06 22:54:36,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:54:36,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-06 22:54:36,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:54:36,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-06 22:54:36,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-06 22:54:36,223 INFO L87 Difference]: Start difference. First operand 216 states and 261 transitions. Second operand has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-06 22:54:37,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:54:37,425 INFO L93 Difference]: Finished difference Result 266 states and 335 transitions. [2024-11-06 22:54:37,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-06 22:54:37,427 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 43 [2024-11-06 22:54:37,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:54:37,429 INFO L225 Difference]: With dead ends: 266 [2024-11-06 22:54:37,429 INFO L226 Difference]: Without dead ends: 264 [2024-11-06 22:54:37,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2024-11-06 22:54:37,433 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 45 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 22:54:37,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 258 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 22:54:37,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-06 22:54:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 228. [2024-11-06 22:54:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 139 states have (on average 1.1654676258992807) internal successors, (162), 150 states have internal predecessors, (162), 57 states have call successors, (57), 31 states have call predecessors, (57), 31 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-06 22:54:37,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 270 transitions. [2024-11-06 22:54:37,479 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 270 transitions. Word has length 43 [2024-11-06 22:54:37,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:54:37,479 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 270 transitions. [2024-11-06 22:54:37,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-06 22:54:37,480 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 270 transitions. [2024-11-06 22:54:37,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 22:54:37,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:54:37,481 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:54:37,497 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 22:54:37,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:37,684 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:54:37,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:54:37,685 INFO L85 PathProgramCache]: Analyzing trace with hash -740326292, now seen corresponding path program 1 times [2024-11-06 22:54:37,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:54:37,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856923187] [2024-11-06 22:54:37,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:37,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:54:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-06 22:54:37,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1005464063] [2024-11-06 22:54:37,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:37,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:37,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:54:37,700 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 22:54:37,703 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 22:54:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:37,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-06 22:54:37,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:54:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-06 22:54:38,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:54:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-06 22:54:38,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:54:38,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856923187] [2024-11-06 22:54:38,444 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-06 22:54:38,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005464063] [2024-11-06 22:54:38,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005464063] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:54:38,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:54:38,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-11-06 22:54:38,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340295490] [2024-11-06 22:54:38,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:54:38,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-06 22:54:38,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:54:38,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-06 22:54:38,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-06 22:54:38,447 INFO L87 Difference]: Start difference. First operand 228 states and 270 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-06 22:54:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:54:39,367 INFO L93 Difference]: Finished difference Result 277 states and 342 transitions. [2024-11-06 22:54:39,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-06 22:54:39,367 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 48 [2024-11-06 22:54:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:54:39,369 INFO L225 Difference]: With dead ends: 277 [2024-11-06 22:54:39,369 INFO L226 Difference]: Without dead ends: 235 [2024-11-06 22:54:39,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2024-11-06 22:54:39,370 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 26 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 22:54:39,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 290 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 22:54:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-06 22:54:39,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 200. [2024-11-06 22:54:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 129 states have (on average 1.1472868217054264) internal successors, (148), 135 states have internal predecessors, (148), 43 states have call successors, (43), 28 states have call predecessors, (43), 27 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-06 22:54:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 229 transitions. [2024-11-06 22:54:39,408 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 229 transitions. Word has length 48 [2024-11-06 22:54:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:54:39,408 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 229 transitions. [2024-11-06 22:54:39,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-06 22:54:39,408 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 229 transitions. [2024-11-06 22:54:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-06 22:54:39,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:54:39,409 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:54:39,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-06 22:54:39,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:39,610 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:54:39,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:54:39,610 INFO L85 PathProgramCache]: Analyzing trace with hash -715006568, now seen corresponding path program 1 times [2024-11-06 22:54:39,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:54:39,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381725470] [2024-11-06 22:54:39,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:39,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:54:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-06 22:54:39,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2142522145] [2024-11-06 22:54:39,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:39,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:39,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:54:39,627 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 22:54:39,629 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 22:54:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:39,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-06 22:54:39,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:54:39,908 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-06 22:54:39,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:54:40,147 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-06 22:54:40,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:54:40,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381725470] [2024-11-06 22:54:40,147 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-06 22:54:40,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142522145] [2024-11-06 22:54:40,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142522145] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:54:40,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:54:40,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-06 22:54:40,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678070966] [2024-11-06 22:54:40,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:54:40,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-06 22:54:40,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:54:40,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-06 22:54:40,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-06 22:54:40,149 INFO L87 Difference]: Start difference. First operand 200 states and 229 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 14 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-06 22:54:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:54:40,477 INFO L93 Difference]: Finished difference Result 220 states and 255 transitions. [2024-11-06 22:54:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 22:54:40,478 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 14 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 57 [2024-11-06 22:54:40,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:54:40,480 INFO L225 Difference]: With dead ends: 220 [2024-11-06 22:54:40,480 INFO L226 Difference]: Without dead ends: 213 [2024-11-06 22:54:40,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2024-11-06 22:54:40,481 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 41 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 22:54:40,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 343 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 22:54:40,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-06 22:54:40,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 191. [2024-11-06 22:54:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 129 states have (on average 1.1395348837209303) internal successors, (147), 131 states have internal predecessors, (147), 34 states have call successors, (34), 28 states have call predecessors, (34), 27 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-06 22:54:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 213 transitions. [2024-11-06 22:54:40,512 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 213 transitions. Word has length 57 [2024-11-06 22:54:40,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:54:40,512 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 213 transitions. [2024-11-06 22:54:40,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 14 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-06 22:54:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2024-11-06 22:54:40,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-06 22:54:40,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:54:40,513 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:54:40,530 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 22:54:40,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:40,718 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:54:40,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:54:40,718 INFO L85 PathProgramCache]: Analyzing trace with hash -388853941, now seen corresponding path program 1 times [2024-11-06 22:54:40,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:54:40,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451120600] [2024-11-06 22:54:40,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:40,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:54:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:40,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:54:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:40,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:54:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:40,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:54:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:40,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:54:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:40,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:54:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:40,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-06 22:54:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:40,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-06 22:54:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:40,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-06 22:54:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:40,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-06 22:54:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-06 22:54:40,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:54:40,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451120600] [2024-11-06 22:54:40,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451120600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:54:40,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779179400] [2024-11-06 22:54:40,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:40,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:40,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:54:40,905 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 22:54:40,906 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 22:54:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:40,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-06 22:54:40,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:54:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-06 22:54:41,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:54:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-06 22:54:41,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779179400] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:54:41,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:54:41,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 13 [2024-11-06 22:54:41,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044432394] [2024-11-06 22:54:41,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:54:41,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 22:54:41,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:54:41,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 22:54:41,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-06 22:54:41,103 INFO L87 Difference]: Start difference. First operand 191 states and 213 transitions. Second operand has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-06 22:54:41,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:54:41,232 INFO L93 Difference]: Finished difference Result 217 states and 242 transitions. [2024-11-06 22:54:41,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 22:54:41,233 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 59 [2024-11-06 22:54:41,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:54:41,234 INFO L225 Difference]: With dead ends: 217 [2024-11-06 22:54:41,234 INFO L226 Difference]: Without dead ends: 197 [2024-11-06 22:54:41,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-06 22:54:41,236 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:54:41,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 106 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:54:41,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-06 22:54:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 98. [2024-11-06 22:54:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.106060606060606) internal successors, (73), 68 states have internal predecessors, (73), 17 states have call successors, (17), 14 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-06 22:54:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2024-11-06 22:54:41,257 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 59 [2024-11-06 22:54:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:54:41,257 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2024-11-06 22:54:41,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-06 22:54:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-11-06 22:54:41,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-06 22:54:41,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:54:41,259 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:54:41,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-06 22:54:41,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-06 22:54:41,460 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:54:41,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:54:41,460 INFO L85 PathProgramCache]: Analyzing trace with hash 985491918, now seen corresponding path program 2 times [2024-11-06 22:54:41,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:54:41,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862353809] [2024-11-06 22:54:41,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:41,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:54:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:41,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:54:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:41,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:54:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:41,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:54:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:41,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:54:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:41,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:54:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:41,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-06 22:54:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:41,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-06 22:54:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:41,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-06 22:54:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:41,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-06 22:54:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:41,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-06 22:54:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:41,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-06 22:54:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:41,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-06 22:54:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:41,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 22:54:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:41,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-06 22:54:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-06 22:54:41,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:54:41,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862353809] [2024-11-06 22:54:41,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862353809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:54:41,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871692794] [2024-11-06 22:54:41,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:54:41,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:41,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:54:41,630 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 22:54:41,632 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 22:54:41,690 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 22:54:41,691 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:54:41,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 22:54:41,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:54:41,778 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-06 22:54:41,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:54:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-06 22:54:41,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871692794] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:54:41,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:54:41,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2024-11-06 22:54:41,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141453660] [2024-11-06 22:54:41,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:54:41,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 22:54:41,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:54:41,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 22:54:41,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-06 22:54:41,903 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2024-11-06 22:54:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:54:42,113 INFO L93 Difference]: Finished difference Result 233 states and 258 transitions. [2024-11-06 22:54:42,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-06 22:54:42,113 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) Word has length 95 [2024-11-06 22:54:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:54:42,115 INFO L225 Difference]: With dead ends: 233 [2024-11-06 22:54:42,115 INFO L226 Difference]: Without dead ends: 224 [2024-11-06 22:54:42,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2024-11-06 22:54:42,115 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:54:42,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 138 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:54:42,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-06 22:54:42,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 212. [2024-11-06 22:54:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 144 states have (on average 1.0902777777777777) internal successors, (157), 146 states have internal predecessors, (157), 35 states have call successors, (35), 32 states have call predecessors, (35), 32 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-06 22:54:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 225 transitions. [2024-11-06 22:54:42,151 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 225 transitions. Word has length 95 [2024-11-06 22:54:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:54:42,152 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 225 transitions. [2024-11-06 22:54:42,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2024-11-06 22:54:42,152 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 225 transitions. [2024-11-06 22:54:42,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-06 22:54:42,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:54:42,154 INFO L215 NwaCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:54:42,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-06 22:54:42,354 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,SelfDestructingSolverStorable13 [2024-11-06 22:54:42,354 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:54:42,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:54:42,355 INFO L85 PathProgramCache]: Analyzing trace with hash 325062734, now seen corresponding path program 3 times [2024-11-06 22:54:42,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:54:42,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072597305] [2024-11-06 22:54:42,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:42,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:54:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:54:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:54:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:54:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:54:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:54:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-06 22:54:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-06 22:54:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-06 22:54:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-06 22:54:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-06 22:54:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-06 22:54:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-06 22:54:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 22:54:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-06 22:54:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-06 22:54:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-06 22:54:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-06 22:54:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-06 22:54:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-06 22:54:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-06 22:54:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-06 22:54:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-06 22:54:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-06 22:54:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-06 22:54:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-06 22:54:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-06 22:54:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-06 22:54:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-06 22:54:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-06 22:54:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-06 22:54:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-06 22:54:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-06 22:54:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2024-11-06 22:54:42,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:54:42,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072597305] [2024-11-06 22:54:42,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072597305] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:54:42,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589344158] [2024-11-06 22:54:42,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 22:54:42,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:42,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:54:42,861 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 22:54:42,863 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 22:54:42,981 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2024-11-06 22:54:42,982 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:54:42,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-06 22:54:42,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:54:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 1955 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-06 22:54:43,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:54:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2024-11-06 22:54:43,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589344158] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:54:43,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:54:43,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 26 [2024-11-06 22:54:43,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437445828] [2024-11-06 22:54:43,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:54:43,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-06 22:54:43,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:54:43,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-06 22:54:43,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2024-11-06 22:54:43,488 INFO L87 Difference]: Start difference. First operand 212 states and 225 transitions. Second operand has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (97), 13 states have call predecessors, (97), 12 states have return successors, (96), 22 states have call predecessors, (96), 22 states have call successors, (96) [2024-11-06 22:54:44,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:54:44,117 INFO L93 Difference]: Finished difference Result 473 states and 522 transitions. [2024-11-06 22:54:44,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-06 22:54:44,118 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (97), 13 states have call predecessors, (97), 12 states have return successors, (96), 22 states have call predecessors, (96), 22 states have call successors, (96) Word has length 209 [2024-11-06 22:54:44,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:54:44,120 INFO L225 Difference]: With dead ends: 473 [2024-11-06 22:54:44,120 INFO L226 Difference]: Without dead ends: 464 [2024-11-06 22:54:44,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2024-11-06 22:54:44,124 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 155 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 22:54:44,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 242 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 22:54:44,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-06 22:54:44,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 440. [2024-11-06 22:54:44,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 300 states have (on average 1.0833333333333333) internal successors, (325), 302 states have internal predecessors, (325), 71 states have call successors, (71), 68 states have call predecessors, (71), 68 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-06 22:54:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 465 transitions. [2024-11-06 22:54:44,222 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 465 transitions. Word has length 209 [2024-11-06 22:54:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:54:44,223 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 465 transitions. [2024-11-06 22:54:44,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (97), 13 states have call predecessors, (97), 12 states have return successors, (96), 22 states have call predecessors, (96), 22 states have call successors, (96) [2024-11-06 22:54:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 465 transitions. [2024-11-06 22:54:44,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2024-11-06 22:54:44,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:54:44,231 INFO L215 NwaCegarLoop]: trace histogram [67, 66, 66, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:54:44,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-06 22:54:44,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:44,432 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:54:44,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:54:44,432 INFO L85 PathProgramCache]: Analyzing trace with hash -767722162, now seen corresponding path program 4 times [2024-11-06 22:54:44,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:54:44,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334638095] [2024-11-06 22:54:44,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:44,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:54:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:54:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:54:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:54:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:54:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:54:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-06 22:54:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-06 22:54:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-06 22:54:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-06 22:54:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-06 22:54:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-06 22:54:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-06 22:54:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 22:54:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-06 22:54:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-06 22:54:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-06 22:54:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-06 22:54:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-06 22:54:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-06 22:54:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-06 22:54:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-06 22:54:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-06 22:54:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-06 22:54:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-06 22:54:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-06 22:54:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-06 22:54:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-06 22:54:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-06 22:54:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-06 22:54:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-06 22:54:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-06 22:54:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-06 22:54:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-06 22:54:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-06 22:54:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-06 22:54:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-06 22:54:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-06 22:54:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-06 22:54:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-06 22:54:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-06 22:54:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-06 22:54:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-06 22:54:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-06 22:54:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-06 22:54:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-06 22:54:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-06 22:54:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-11-06 22:54:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-06 22:54:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-11-06 22:54:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2024-11-06 22:54:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2024-11-06 22:54:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-11-06 22:54:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-11-06 22:54:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-11-06 22:54:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-11-06 22:54:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-06 22:54:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-06 22:54:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-11-06 22:54:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-11-06 22:54:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-11-06 22:54:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2024-11-06 22:54:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2024-11-06 22:54:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:45,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2024-11-06 22:54:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:46,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2024-11-06 22:54:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:46,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2024-11-06 22:54:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:46,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2024-11-06 22:54:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:46,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-11-06 22:54:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:46,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2024-11-06 22:54:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 1661 refuted. 0 times theorem prover too weak. 8584 trivial. 0 not checked. [2024-11-06 22:54:46,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:54:46,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334638095] [2024-11-06 22:54:46,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334638095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:54:46,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755499841] [2024-11-06 22:54:46,015 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-06 22:54:46,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:46,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:54:46,018 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 22:54:46,020 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 22:54:46,222 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-06 22:54:46,222 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:54:46,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-06 22:54:46,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:54:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 9977 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-06 22:54:46,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:54:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 1661 refuted. 0 times theorem prover too weak. 8584 trivial. 0 not checked. [2024-11-06 22:54:47,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755499841] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:54:47,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:54:47,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 26] total 50 [2024-11-06 22:54:47,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919747263] [2024-11-06 22:54:47,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:54:47,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-06 22:54:47,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:54:47,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-06 22:54:47,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2024-11-06 22:54:47,695 INFO L87 Difference]: Start difference. First operand 440 states and 465 transitions. Second operand has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (205), 25 states have call predecessors, (205), 24 states have return successors, (204), 46 states have call predecessors, (204), 46 states have call successors, (204) [2024-11-06 22:54:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:54:49,482 INFO L93 Difference]: Finished difference Result 953 states and 1050 transitions. [2024-11-06 22:54:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-11-06 22:54:49,482 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (205), 25 states have call predecessors, (205), 24 states have return successors, (204), 46 states have call predecessors, (204), 46 states have call successors, (204) Word has length 437 [2024-11-06 22:54:49,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:54:49,487 INFO L225 Difference]: With dead ends: 953 [2024-11-06 22:54:49,487 INFO L226 Difference]: Without dead ends: 944 [2024-11-06 22:54:49,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1078 GetRequests, 985 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2024-11-06 22:54:49,490 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 441 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 22:54:49,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 354 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 22:54:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-11-06 22:54:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 896. [2024-11-06 22:54:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 612 states have (on average 1.0800653594771241) internal successors, (661), 614 states have internal predecessors, (661), 143 states have call successors, (143), 140 states have call predecessors, (143), 140 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2024-11-06 22:54:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 945 transitions. [2024-11-06 22:54:49,607 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 945 transitions. Word has length 437 [2024-11-06 22:54:49,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:54:49,611 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 945 transitions. [2024-11-06 22:54:49,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (205), 25 states have call predecessors, (205), 24 states have return successors, (204), 46 states have call predecessors, (204), 46 states have call successors, (204) [2024-11-06 22:54:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 945 transitions. [2024-11-06 22:54:49,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2024-11-06 22:54:49,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:54:49,636 INFO L215 NwaCegarLoop]: trace histogram [139, 138, 138, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:54:49,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-06 22:54:49,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:49,840 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:54:49,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:54:49,841 INFO L85 PathProgramCache]: Analyzing trace with hash -776415410, now seen corresponding path program 5 times [2024-11-06 22:54:49,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:54:49,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391259558] [2024-11-06 22:54:49,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:54:49,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:54:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 22:54:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 22:54:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 22:54:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 22:54:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 22:54:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-06 22:54:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-06 22:54:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-06 22:54:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-06 22:54:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-06 22:54:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-06 22:54:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-06 22:54:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 22:54:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-06 22:54:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-06 22:54:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-06 22:54:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-06 22:54:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-06 22:54:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-06 22:54:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-06 22:54:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-06 22:54:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-06 22:54:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-06 22:54:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-06 22:54:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-06 22:54:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-06 22:54:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-06 22:54:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-06 22:54:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-06 22:54:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-06 22:54:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-06 22:54:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-06 22:54:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-06 22:54:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-06 22:54:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-06 22:54:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-06 22:54:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-06 22:54:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-06 22:54:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-06 22:54:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-06 22:54:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-06 22:54:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-06 22:54:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-06 22:54:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-06 22:54:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-06 22:54:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-06 22:54:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-11-06 22:54:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-11-06 22:54:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2024-11-06 22:54:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2024-11-06 22:54:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2024-11-06 22:54:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-11-06 22:54:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-11-06 22:54:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-11-06 22:54:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2024-11-06 22:54:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2024-11-06 22:54:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2024-11-06 22:54:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-11-06 22:54:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 367 [2024-11-06 22:54:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2024-11-06 22:54:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2024-11-06 22:54:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2024-11-06 22:54:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 395 [2024-11-06 22:54:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2024-11-06 22:54:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2024-11-06 22:54:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2024-11-06 22:54:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-11-06 22:54:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 424 [2024-11-06 22:54:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2024-11-06 22:54:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 438 [2024-11-06 22:54:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2024-11-06 22:54:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2024-11-06 22:54:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2024-11-06 22:54:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 462 [2024-11-06 22:54:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 471 [2024-11-06 22:54:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 476 [2024-11-06 22:54:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 481 [2024-11-06 22:54:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 490 [2024-11-06 22:54:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 495 [2024-11-06 22:54:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2024-11-06 22:54:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2024-11-06 22:54:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2024-11-06 22:54:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 519 [2024-11-06 22:54:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 528 [2024-11-06 22:54:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2024-11-06 22:54:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 538 [2024-11-06 22:54:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2024-11-06 22:54:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2024-11-06 22:54:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 557 [2024-11-06 22:54:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 566 [2024-11-06 22:54:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 571 [2024-11-06 22:54:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 576 [2024-11-06 22:54:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 585 [2024-11-06 22:54:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 590 [2024-11-06 22:54:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 595 [2024-11-06 22:54:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 604 [2024-11-06 22:54:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 609 [2024-11-06 22:54:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 614 [2024-11-06 22:54:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623 [2024-11-06 22:54:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 628 [2024-11-06 22:54:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 633 [2024-11-06 22:54:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 642 [2024-11-06 22:54:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 647 [2024-11-06 22:54:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 652 [2024-11-06 22:54:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 661 [2024-11-06 22:54:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 666 [2024-11-06 22:54:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 671 [2024-11-06 22:54:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 680 [2024-11-06 22:54:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 685 [2024-11-06 22:54:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 690 [2024-11-06 22:54:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 699 [2024-11-06 22:54:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 704 [2024-11-06 22:54:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 709 [2024-11-06 22:54:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 718 [2024-11-06 22:54:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 723 [2024-11-06 22:54:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 728 [2024-11-06 22:54:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 737 [2024-11-06 22:54:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 742 [2024-11-06 22:54:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 747 [2024-11-06 22:54:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2024-11-06 22:54:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 761 [2024-11-06 22:54:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 766 [2024-11-06 22:54:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 775 [2024-11-06 22:54:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 780 [2024-11-06 22:54:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 785 [2024-11-06 22:54:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 794 [2024-11-06 22:54:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 799 [2024-11-06 22:54:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 804 [2024-11-06 22:54:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 813 [2024-11-06 22:54:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 818 [2024-11-06 22:54:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 823 [2024-11-06 22:54:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 832 [2024-11-06 22:54:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 837 [2024-11-06 22:54:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 842 [2024-11-06 22:54:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 851 [2024-11-06 22:54:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 856 [2024-11-06 22:54:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 861 [2024-11-06 22:54:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 870 [2024-11-06 22:54:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 875 [2024-11-06 22:54:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 880 [2024-11-06 22:54:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:54:54,415 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 7337 refuted. 0 times theorem prover too weak. 37816 trivial. 0 not checked. [2024-11-06 22:54:54,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:54:54,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391259558] [2024-11-06 22:54:54,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391259558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:54:54,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144038620] [2024-11-06 22:54:54,416 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-06 22:54:54,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:54:54,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:54:54,418 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 22:54:54,421 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 22:55:13,863 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2024-11-06 22:55:13,863 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:55:13,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 1911 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-06 22:55:13,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:55:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 44597 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-06 22:55:14,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:55:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 45429 backedges. 276 proven. 7337 refuted. 0 times theorem prover too weak. 37816 trivial. 0 not checked. [2024-11-06 22:55:16,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144038620] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:55:16,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:55:16,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 50] total 54 [2024-11-06 22:55:16,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624117122] [2024-11-06 22:55:16,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:55:16,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-06 22:55:16,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:55:16,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-06 22:55:16,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2024-11-06 22:55:16,150 INFO L87 Difference]: Start difference. First operand 896 states and 945 transitions. Second operand has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (292), 49 states have call predecessors, (292), 48 states have return successors, (291), 50 states have call predecessors, (291), 50 states have call successors, (291) [2024-11-06 22:55:17,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:55:17,944 INFO L93 Difference]: Finished difference Result 989 states and 1050 transitions. [2024-11-06 22:55:17,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-06 22:55:17,946 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (292), 49 states have call predecessors, (292), 48 states have return successors, (291), 50 states have call predecessors, (291), 50 states have call successors, (291) Word has length 893 [2024-11-06 22:55:17,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:55:17,951 INFO L225 Difference]: With dead ends: 989 [2024-11-06 22:55:17,951 INFO L226 Difference]: Without dead ends: 980 [2024-11-06 22:55:17,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2162 GetRequests, 2017 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2024-11-06 22:55:17,955 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 183 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 22:55:17,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 384 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 22:55:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2024-11-06 22:55:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 972. [2024-11-06 22:55:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 664 states have (on average 1.0798192771084338) internal successors, (717), 666 states have internal predecessors, (717), 155 states have call successors, (155), 152 states have call predecessors, (155), 152 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2024-11-06 22:55:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1025 transitions. [2024-11-06 22:55:18,073 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1025 transitions. Word has length 893 [2024-11-06 22:55:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:55:18,074 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1025 transitions. [2024-11-06 22:55:18,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (292), 49 states have call predecessors, (292), 48 states have return successors, (291), 50 states have call predecessors, (291), 50 states have call successors, (291) [2024-11-06 22:55:18,075 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1025 transitions. [2024-11-06 22:55:18,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2024-11-06 22:55:18,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:55:18,083 INFO L215 NwaCegarLoop]: trace histogram [151, 150, 150, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:55:18,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-06 22:55:18,283 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,SelfDestructingSolverStorable16 [2024-11-06 22:55:18,283 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:55:18,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:55:18,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1208919630, now seen corresponding path program 6 times [2024-11-06 22:55:18,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:55:18,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192541583] [2024-11-06 22:55:18,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:55:18,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:55:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-06 22:55:18,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419272403] [2024-11-06 22:55:18,647 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-06 22:55:18,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:55:18,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:55:18,649 INFO L229 MonitoredProcess]: Starting monitored process 16 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 22:55:18,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-06 22:55:20,505 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 98 check-sat command(s) [2024-11-06 22:55:20,506 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-06 22:55:20,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 22:55:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 22:55:20,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 22:55:20,888 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 22:55:20,888 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 22:55:20,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-06 22:55:21,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-06 22:55:21,092 INFO L407 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:55:21,313 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 22:55:21,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:55:21 BoogieIcfgContainer [2024-11-06 22:55:21,316 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 22:55:21,316 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 22:55:21,316 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 22:55:21,316 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 22:55:21,317 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:54:30" (3/4) ... [2024-11-06 22:55:21,318 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-06 22:55:21,483 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 22:55:21,483 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 22:55:21,484 INFO L158 Benchmark]: Toolchain (without parser) took 51135.39ms. Allocated memory was 117.4MB in the beginning and 662.7MB in the end (delta: 545.3MB). Free memory was 92.2MB in the beginning and 323.0MB in the end (delta: -230.7MB). Peak memory consumption was 313.8MB. Max. memory is 16.1GB. [2024-11-06 22:55:21,484 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:55:21,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.87ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 80.9MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:55:21,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.07ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 22:55:21,485 INFO L158 Benchmark]: Boogie Preprocessor took 33.80ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:55:21,485 INFO L158 Benchmark]: RCFGBuilder took 287.23ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 67.7MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 22:55:21,486 INFO L158 Benchmark]: TraceAbstraction took 50396.31ms. Allocated memory was 117.4MB in the beginning and 662.7MB in the end (delta: 545.3MB). Free memory was 67.2MB in the beginning and 352.3MB in the end (delta: -285.1MB). Peak memory consumption was 255.1MB. Max. memory is 16.1GB. [2024-11-06 22:55:21,486 INFO L158 Benchmark]: Witness Printer took 167.07ms. Allocated memory is still 662.7MB. Free memory was 352.3MB in the beginning and 323.0MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-06 22:55:21,487 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.78ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.87ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 80.9MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.07ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.80ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 287.23ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 67.7MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 50396.31ms. Allocated memory was 117.4MB in the beginning and 662.7MB in the end (delta: 545.3MB). Free memory was 67.2MB in the beginning and 352.3MB in the end (delta: -285.1MB). Peak memory consumption was 255.1MB. Max. memory is 16.1GB. * Witness Printer took 167.07ms. Allocated memory is still 662.7MB. Free memory was 352.3MB in the beginning and 323.0MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. 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: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=52, y=1] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=52, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=52, b=1, counter=0, p=1, q=0, r=0, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=52, b=1, counter=1, p=1, q=0, r=0, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=51, b=1, counter=1, p=1, q=0, r=-1, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=51, b=1, counter=2, p=1, q=0, r=-1, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=50, b=1, counter=2, p=1, q=0, r=-2, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=50, b=1, counter=3, p=1, q=0, r=-2, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=49, b=1, counter=3, p=1, q=0, r=-3, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=49, b=1, counter=4, p=1, q=0, r=-3, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=48, b=1, counter=4, p=1, q=0, r=-4, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=48, b=1, counter=5, p=1, q=0, r=-4, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=47, b=1, counter=5, p=1, q=0, r=-5, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=47, b=1, counter=6, p=1, q=0, r=-5, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=46, b=1, counter=6, p=1, q=0, r=-6, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=46, b=1, counter=7, p=1, q=0, r=-6, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=45, b=1, counter=7, p=1, q=0, r=-7, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=45, b=1, counter=8, p=1, q=0, r=-7, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=44, b=1, counter=8, p=1, q=0, r=-8, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=44, b=1, counter=9, p=1, q=0, r=-8, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=43, b=1, counter=9, p=1, q=0, r=-9, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=43, b=1, counter=10, p=1, q=0, r=-9, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=42, b=1, counter=10, p=1, q=0, r=-10, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=42, b=1, counter=11, p=1, q=0, r=-10, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=41, b=1, counter=11, p=1, q=0, r=-11, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=41, b=1, counter=12, p=1, q=0, r=-11, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=40, b=1, counter=12, p=1, q=0, r=-12, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=40, b=1, counter=13, p=1, q=0, r=-12, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=39, b=1, counter=13, p=1, q=0, r=-13, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=39, b=1, counter=14, p=1, q=0, r=-13, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=38, b=1, counter=14, p=1, q=0, r=-14, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=38, b=1, counter=15, p=1, q=0, r=-14, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=37, b=1, counter=15, p=1, q=0, r=-15, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=37, b=1, counter=16, p=1, q=0, r=-15, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=36, b=1, counter=16, p=1, q=0, r=-16, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=36, b=1, counter=17, p=1, q=0, r=-16, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=35, b=1, counter=17, p=1, q=0, r=-17, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=35, b=1, counter=18, p=1, q=0, r=-17, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=34, b=1, counter=18, p=1, q=0, r=-18, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=34, b=1, counter=19, p=1, q=0, r=-18, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=33, b=1, counter=19, p=1, q=0, r=-19, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=33, b=1, counter=20, p=1, q=0, r=-19, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=32, b=1, counter=20, p=1, q=0, r=-20, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=32, b=1, counter=21, p=1, q=0, r=-20, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=31, b=1, counter=21, p=1, q=0, r=-21, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=31, b=1, counter=22, p=1, q=0, r=-21, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=30, b=1, counter=22, p=1, q=0, r=-22, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=30, b=1, counter=23, p=1, q=0, r=-22, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=29, b=1, counter=23, p=1, q=0, r=-23, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=24] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=29, b=1, counter=24, p=1, q=0, r=-23, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=28, b=1, counter=24, p=1, q=0, r=-24, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=28, b=1, counter=25, p=1, q=0, r=-24, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=27, b=1, counter=25, p=1, q=0, r=-25, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=27, b=1, counter=26, p=1, q=0, r=-25, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=26, b=1, counter=26, p=1, q=0, r=-26, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=27] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=26, b=1, counter=27, p=1, q=0, r=-26, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=25, b=1, counter=27, p=1, q=0, r=-27, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=25, b=1, counter=28, p=1, q=0, r=-27, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=24, b=1, counter=28, p=1, q=0, r=-28, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=24, b=1, counter=29, p=1, q=0, r=-28, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=23, b=1, counter=29, p=1, q=0, r=-29, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=30] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=23, b=1, counter=30, p=1, q=0, r=-29, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=22, b=1, counter=30, p=1, q=0, r=-30, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=22, b=1, counter=31, p=1, q=0, r=-30, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=21, b=1, counter=31, p=1, q=0, r=-31, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=21, b=1, counter=32, p=1, q=0, r=-31, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=20, b=1, counter=32, p=1, q=0, r=-32, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=20, b=1, counter=33, p=1, q=0, r=-32, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=19, b=1, counter=33, p=1, q=0, r=-33, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=19, b=1, counter=34, p=1, q=0, r=-33, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=18, b=1, counter=34, p=1, q=0, r=-34, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=18, b=1, counter=35, p=1, q=0, r=-34, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=17, b=1, counter=35, p=1, q=0, r=-35, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=36] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=17, b=1, counter=36, p=1, q=0, r=-35, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=16, b=1, counter=36, p=1, q=0, r=-36, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=16, b=1, counter=37, p=1, q=0, r=-36, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=15, b=1, counter=37, p=1, q=0, r=-37, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=15, b=1, counter=38, p=1, q=0, r=-37, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=14, b=1, counter=38, p=1, q=0, r=-38, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=39] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=14, b=1, counter=39, p=1, q=0, r=-38, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=13, b=1, counter=39, p=1, q=0, r=-39, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=13, b=1, counter=40, p=1, q=0, r=-39, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=12, b=1, counter=40, p=1, q=0, r=-40, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=12, b=1, counter=41, p=1, q=0, r=-40, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=11, b=1, counter=41, p=1, q=0, r=-41, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=42] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=1, counter=42, p=1, q=0, r=-41, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=10, b=1, counter=42, p=1, q=0, r=-42, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=10, b=1, counter=43, p=1, q=0, r=-42, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=9, b=1, counter=43, p=1, q=0, r=-43, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=1, counter=44, p=1, q=0, r=-43, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=8, b=1, counter=44, p=1, q=0, r=-44, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=8, b=1, counter=45, p=1, q=0, r=-44, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=7, b=1, counter=45, p=1, q=0, r=-45, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=1, counter=46, p=1, q=0, r=-45, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=6, b=1, counter=46, p=1, q=0, r=-46, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=6, b=1, counter=47, p=1, q=0, r=-46, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=5, b=1, counter=47, p=1, q=0, r=-47, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=48] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=1, counter=48, p=1, q=0, r=-47, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=4, b=1, counter=48, p=1, q=0, r=-48, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=4, b=1, counter=49, p=1, q=0, r=-48, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=3, b=1, counter=49, p=1, q=0, r=-49, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=3, b=1, counter=50, p=1, q=0, r=-49, s=1, x=52, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=2, b=1, counter=50, p=1, q=0, r=-50, s=1, x=52, y=1] [L34] EXPR counter++ VAL [a=2, b=1, counter=51, p=1, q=0, r=-50, s=1, x=52, y=1] [L34] COND FALSE !(counter++<50) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=51] [L11] COND TRUE !(cond) VAL [\old(cond)=0, counter=51] [L13] reach_error() VAL [\old(cond)=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.1s, OverallIterations: 18, TraceHistogramMax: 151, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1080 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1049 mSDsluCounter, 3141 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2603 mSDsCounter, 356 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2146 IncrementalHoareTripleChecker+Invalid, 2502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 356 mSolverCounterUnsat, 538 mSDtfsCounter, 2146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4732 GetRequests, 4308 SyntacticMatches, 46 SemanticMatches, 378 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4226 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=972occurred in iteration=17, InterpolantAutomatonStates: 364, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 303 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 22.2s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 6068 NumberOfCodeBlocks, 6053 NumberOfCodeBlocksAsserted, 241 NumberOfCheckSat, 5718 ConstructedInterpolants, 0 QuantifiedInterpolants, 13658 SizeOfPredicates, 104 NumberOfNonLiveVariables, 4657 ConjunctsInSsa, 351 ConjunctsInUnsatCore, 33 InterpolantComputations, 8 PerfectInterpolantSequences, 100119/175782 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 22:55:21,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE