./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_dekker_unfair.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_dekker_unfair.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 ee7ff83d9ca4f9baaadd009c98a7dd30697b6140296199117a6b05757b5b9f74 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:51:24,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:51:24,728 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:51:24,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:51:24,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:51:24,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:51:24,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:51:24,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:51:24,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:51:24,761 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:51:24,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:51:24,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:51:24,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:51:24,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:51:24,764 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:51:24,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:51:24,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:51:24,765 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:51:24,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:51:24,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:51:24,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:51:24,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:51:24,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:51:24,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:51:24,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:51:24,768 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:51:24,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:51:24,769 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:51:24,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:51:24,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:51:24,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:51:24,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:51:24,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:51:24,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:51:24,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:51:24,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:51:24,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:51:24,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:51:24,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:51:24,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:51:24,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:51:24,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:51:24,773 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> ee7ff83d9ca4f9baaadd009c98a7dd30697b6140296199117a6b05757b5b9f74 [2024-11-11 21:51:25,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:51:25,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:51:25,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:51:25,073 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:51:25,074 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:51:25,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_dekker_unfair.i [2024-11-11 21:51:26,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:51:26,910 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:51:26,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_dekker_unfair.i [2024-11-11 21:51:26,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee3cf74cd/3e0d1e21ebf743b8b6813c2e032853c0/FLAGbcaff5569 [2024-11-11 21:51:26,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee3cf74cd/3e0d1e21ebf743b8b6813c2e032853c0 [2024-11-11 21:51:26,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:51:26,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:51:26,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:51:26,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:51:26,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:51:26,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:51:26" (1/1) ... [2024-11-11 21:51:26,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c0cfb07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:26, skipping insertion in model container [2024-11-11 21:51:26,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:51:26" (1/1) ... [2024-11-11 21:51:27,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:51:27,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_dekker_unfair.i[23603,23616] [2024-11-11 21:51:27,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:51:27,656 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:51:27,684 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_dekker_unfair.i[23603,23616] [2024-11-11 21:51:27,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:51:27,782 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:51:27,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:27 WrapperNode [2024-11-11 21:51:27,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:51:27,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:51:27,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:51:27,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:51:27,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:27" (1/1) ... [2024-11-11 21:51:27,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:27" (1/1) ... [2024-11-11 21:51:27,865 INFO L138 Inliner]: procedures = 145, calls = 309, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 463 [2024-11-11 21:51:27,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:51:27,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:51:27,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:51:27,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:51:27,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:27" (1/1) ... [2024-11-11 21:51:27,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:27" (1/1) ... [2024-11-11 21:51:27,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:27" (1/1) ... [2024-11-11 21:51:27,927 INFO L175 MemorySlicer]: Split 158 memory accesses to 18 slices as follows [2, 8, 8, 5, 0, 8, 13, 29, 21, 7, 7, 9, 7, 5, 5, 13, 6, 5]. 18 percent of accesses are in the largest equivalence class. The 43 initializations are split as follows [2, 3, 3, 0, 0, 3, 0, 9, 9, 3, 3, 3, 3, 0, 0, 0, 2, 0]. The 39 writes are split as follows [0, 2, 2, 1, 0, 2, 1, 11, 6, 2, 2, 2, 2, 1, 1, 1, 2, 1]. [2024-11-11 21:51:27,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:27" (1/1) ... [2024-11-11 21:51:27,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:27" (1/1) ... [2024-11-11 21:51:27,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:27" (1/1) ... [2024-11-11 21:51:27,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:27" (1/1) ... [2024-11-11 21:51:27,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:27" (1/1) ... [2024-11-11 21:51:27,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:27" (1/1) ... [2024-11-11 21:51:28,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:51:28,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:51:28,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:51:28,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:51:28,008 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:27" (1/1) ... [2024-11-11 21:51:28,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:51:28,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:51:28,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:51:28,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:51:28,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 21:51:28,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 21:51:28,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-11 21:51:28,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-11 21:51:28,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-11 21:51:28,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-11 21:51:28,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-11 21:51:28,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-11 21:51:28,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-11 21:51:28,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-11 21:51:28,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-11 21:51:28,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-11 21:51:28,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-11 21:51:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-11 21:51:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-11 21:51:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-11 21:51:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-11-11 21:51:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-11-11 21:51:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 21:51:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 21:51:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-11 21:51:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-11 21:51:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-11 21:51:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-11 21:51:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-11 21:51:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-11 21:51:28,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-11 21:51:28,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-11 21:51:28,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-11 21:51:28,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-11 21:51:28,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-11 21:51:28,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-11 21:51:28,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-11 21:51:28,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-11 21:51:28,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-11-11 21:51:28,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-11-11 21:51:28,108 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-11 21:51:28,108 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-11 21:51:28,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:51:28,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 21:51:28,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-11 21:51:28,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-11 21:51:28,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-11 21:51:28,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-11 21:51:28,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-11 21:51:28,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-11 21:51:28,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-11 21:51:28,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-11 21:51:28,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-11 21:51:28,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-11 21:51:28,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-11 21:51:28,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-11 21:51:28,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-11 21:51:28,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-11 21:51:28,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-11 21:51:28,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-11-11 21:51:28,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-11-11 21:51:28,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2024-11-11 21:51:28,113 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-11-11 21:51:28,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-11-11 21:51:28,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-11 21:51:28,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-11 21:51:28,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-11 21:51:28,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-11 21:51:28,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-11 21:51:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-11 21:51:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-11 21:51:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-11 21:51:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-11 21:51:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-11 21:51:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-11 21:51:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-11 21:51:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-11 21:51:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-11 21:51:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-11 21:51:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-11-11 21:51:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-11-11 21:51:28,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2024-11-11 21:51:28,117 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-11-11 21:51:28,117 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-11-11 21:51:28,117 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-11 21:51:28,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-11 21:51:28,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 21:51:28,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-11 21:51:28,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-11 21:51:28,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-11 21:51:28,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-11 21:51:28,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-11 21:51:28,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-11 21:51:28,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-11 21:51:28,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-11 21:51:28,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-11 21:51:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-11 21:51:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-11 21:51:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-11-11 21:51:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-11-11 21:51:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-11-11 21:51:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-11-11 21:51:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-11-11 21:51:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-11-11 21:51:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2024-11-11 21:51:28,120 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-11-11 21:51:28,120 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-11-11 21:51:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:51:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 21:51:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 21:51:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 21:51:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-11 21:51:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-11 21:51:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-11 21:51:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-11 21:51:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-11 21:51:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-11 21:51:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-11 21:51:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-11 21:51:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-11 21:51:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-11 21:51:28,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-11 21:51:28,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-11 21:51:28,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-11 21:51:28,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-11 21:51:28,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:51:28,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:51:28,415 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:51:28,417 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:51:33,099 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2024-11-11 21:51:33,100 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:51:33,118 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:51:33,118 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 21:51:33,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:51:33 BoogieIcfgContainer [2024-11-11 21:51:33,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:51:33,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:51:33,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:51:33,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:51:33,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:51:26" (1/3) ... [2024-11-11 21:51:33,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1653b8b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:51:33, skipping insertion in model container [2024-11-11 21:51:33,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:27" (2/3) ... [2024-11-11 21:51:33,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1653b8b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:51:33, skipping insertion in model container [2024-11-11 21:51:33,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:51:33" (3/3) ... [2024-11-11 21:51:33,130 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_dekker_unfair.i [2024-11-11 21:51:33,148 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:51:33,149 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:51:33,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:51:33,234 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;@47d1bbea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:51:33,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:51:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 78 states have internal predecessors, (103), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-11 21:51:33,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-11 21:51:33,251 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:51:33,252 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:51:33,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:51:33,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:51:33,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1213115201, now seen corresponding path program 1 times [2024-11-11 21:51:33,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:51:33,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230526827] [2024-11-11 21:51:33,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:51:33,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:51:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:51:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 21:51:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 21:51:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 21:51:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:51:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:51:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:51:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:51:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 21:51:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 21:51:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 21:51:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 21:51:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 21:51:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 21:51:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 21:51:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 21:51:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 21:51:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 21:51:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 21:51:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 21:51:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-11 21:51:33,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:51:33,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230526827] [2024-11-11 21:51:33,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230526827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:51:33,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:51:33,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 21:51:33,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386253349] [2024-11-11 21:51:33,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:51:33,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 21:51:33,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:51:33,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 21:51:33,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 21:51:33,985 INFO L87 Difference]: Start difference. First operand has 119 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 78 states have internal predecessors, (103), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-11 21:51:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:51:34,030 INFO L93 Difference]: Finished difference Result 236 states and 377 transitions. [2024-11-11 21:51:34,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 21:51:34,034 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-11-11 21:51:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:51:34,043 INFO L225 Difference]: With dead ends: 236 [2024-11-11 21:51:34,044 INFO L226 Difference]: Without dead ends: 115 [2024-11-11 21:51:34,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-11 21:51:34,052 INFO L435 NwaCegarLoop]: 169 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, 169 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-11 21:51:34,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:51:34,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-11 21:51:34,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-11 21:51:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 74 states have internal predecessors, (95), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-11 21:51:34,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2024-11-11 21:51:34,130 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 132 [2024-11-11 21:51:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:51:34,130 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2024-11-11 21:51:34,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-11 21:51:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2024-11-11 21:51:34,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-11 21:51:34,136 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:51:34,136 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:51:34,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:51:34,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:51:34,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:51:34,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1001836267, now seen corresponding path program 1 times [2024-11-11 21:51:34,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:51:34,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797435179] [2024-11-11 21:51:34,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:51:34,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:51:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:51:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 21:51:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 21:51:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 21:51:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:51:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:51:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:51:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:51:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 21:51:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 21:51:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 21:51:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 21:51:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 21:51:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 21:51:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 21:51:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 21:51:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 21:51:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 21:51:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 21:51:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 21:51:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-11 21:51:34,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:51:34,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797435179] [2024-11-11 21:51:34,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797435179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:51:34,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:51:34,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:51:34,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454763298] [2024-11-11 21:51:34,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:51:34,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:51:34,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:51:34,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:51:34,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:51:34,703 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-11 21:51:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:51:34,769 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2024-11-11 21:51:34,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:51:34,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-11-11 21:51:34,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:51:34,773 INFO L225 Difference]: With dead ends: 228 [2024-11-11 21:51:34,776 INFO L226 Difference]: Without dead ends: 119 [2024-11-11 21:51:34,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:51:34,779 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 4 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:51:34,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 322 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:51:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-11 21:51:34,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2024-11-11 21:51:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-11 21:51:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-11-11 21:51:34,804 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 132 [2024-11-11 21:51:34,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:51:34,805 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-11-11 21:51:34,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-11 21:51:34,805 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-11-11 21:51:34,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-11 21:51:34,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:51:34,811 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:51:34,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:51:34,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:51:34,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:51:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1502592579, now seen corresponding path program 1 times [2024-11-11 21:51:34,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:51:34,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089161320] [2024-11-11 21:51:34,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:51:34,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:51:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:51:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:51:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:51:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 21:51:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 21:51:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:51:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:51:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 21:51:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 21:51:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:51:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 21:51:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 21:51:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 21:51:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 21:51:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 21:51:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 21:51:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 21:51:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 21:51:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:51:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 21:51:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-11 21:51:35,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:51:35,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089161320] [2024-11-11 21:51:35,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089161320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:51:35,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:51:35,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:51:35,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254615161] [2024-11-11 21:51:35,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:51:35,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:51:35,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:51:35,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:51:35,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:51:35,295 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-11 21:51:35,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:51:35,344 INFO L93 Difference]: Finished difference Result 231 states and 332 transitions. [2024-11-11 21:51:35,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:51:35,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2024-11-11 21:51:35,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:51:35,348 INFO L225 Difference]: With dead ends: 231 [2024-11-11 21:51:35,348 INFO L226 Difference]: Without dead ends: 118 [2024-11-11 21:51:35,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:51:35,352 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:51:35,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 323 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:51:35,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-11 21:51:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-11-11 21:51:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 76 states have internal predecessors, (97), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-11 21:51:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2024-11-11 21:51:35,373 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 135 [2024-11-11 21:51:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:51:35,374 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2024-11-11 21:51:35,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-11 21:51:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2024-11-11 21:51:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-11 21:51:35,378 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:51:35,378 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:51:35,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:51:35,379 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:51:35,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:51:35,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1195483263, now seen corresponding path program 1 times [2024-11-11 21:51:35,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:51:35,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738389864] [2024-11-11 21:51:35,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:51:35,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:51:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:51:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 21:51:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 21:51:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 21:51:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 21:51:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 21:51:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:51:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:51:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 21:51:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 21:51:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:51:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 21:51:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 21:51:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 21:51:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 21:51:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 21:51:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 21:51:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 21:51:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 21:51:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-11 21:51:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-11 21:51:35,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:51:35,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738389864] [2024-11-11 21:51:35,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738389864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:51:35,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753573931] [2024-11-11 21:51:35,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:51:35,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:51:35,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:51:35,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:51:35,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 21:51:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:36,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:51:36,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:51:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-11 21:51:36,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:51:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-11 21:51:36,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753573931] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:51:36,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:51:36,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-11 21:51:36,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473354956] [2024-11-11 21:51:36,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:51:36,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:51:36,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:51:36,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:51:36,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:51:36,569 INFO L87 Difference]: Start difference. First operand 117 states and 167 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-11 21:51:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:51:36,618 INFO L93 Difference]: Finished difference Result 235 states and 337 transitions. [2024-11-11 21:51:36,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:51:36,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 137 [2024-11-11 21:51:36,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:51:36,621 INFO L225 Difference]: With dead ends: 235 [2024-11-11 21:51:36,621 INFO L226 Difference]: Without dead ends: 121 [2024-11-11 21:51:36,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:51:36,623 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:51:36,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 803 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:51:36,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-11 21:51:36,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-11 21:51:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 80 states have (on average 1.2625) internal successors, (101), 80 states have internal predecessors, (101), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-11 21:51:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 171 transitions. [2024-11-11 21:51:36,633 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 171 transitions. Word has length 137 [2024-11-11 21:51:36,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:51:36,633 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 171 transitions. [2024-11-11 21:51:36,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-11 21:51:36,634 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 171 transitions. [2024-11-11 21:51:36,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-11 21:51:36,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:51:36,638 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:51:36,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:51:36,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:51:36,840 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:51:36,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:51:36,840 INFO L85 PathProgramCache]: Analyzing trace with hash 14058627, now seen corresponding path program 2 times [2024-11-11 21:51:36,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:51:36,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684587066] [2024-11-11 21:51:36,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:51:36,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:51:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:51:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:51:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 21:51:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 21:51:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:51:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:51:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 21:51:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 21:51:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:51:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 21:51:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 21:51:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 21:51:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 21:51:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 21:51:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 21:51:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 21:51:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 21:51:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:51:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 21:51:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 21:51:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2024-11-11 21:51:37,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:51:37,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684587066] [2024-11-11 21:51:37,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684587066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:51:37,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108758481] [2024-11-11 21:51:37,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 21:51:37,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:51:37,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:51:37,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:51:37,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:51:37,721 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-11 21:51:37,722 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:51:37,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 21:51:37,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:51:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2024-11-11 21:51:38,002 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:51:38,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108758481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:51:38,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:51:38,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-11 21:51:38,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038341803] [2024-11-11 21:51:38,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:51:38,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:51:38,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:51:38,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:51:38,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:51:38,006 INFO L87 Difference]: Start difference. First operand 121 states and 171 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-11 21:51:38,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:51:38,057 INFO L93 Difference]: Finished difference Result 227 states and 328 transitions. [2024-11-11 21:51:38,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:51:38,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2024-11-11 21:51:38,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:51:38,062 INFO L225 Difference]: With dead ends: 227 [2024-11-11 21:51:38,062 INFO L226 Difference]: Without dead ends: 181 [2024-11-11 21:51:38,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:51:38,063 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 84 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:51:38,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 508 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:51:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-11 21:51:38,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-11 21:51:38,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 121 states have (on average 1.3057851239669422) internal successors, (158), 121 states have internal predecessors, (158), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2024-11-11 21:51:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 260 transitions. [2024-11-11 21:51:38,101 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 260 transitions. Word has length 141 [2024-11-11 21:51:38,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:51:38,102 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 260 transitions. [2024-11-11 21:51:38,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-11 21:51:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 260 transitions. [2024-11-11 21:51:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-11 21:51:38,109 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:51:38,109 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:51:38,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 21:51:38,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:51:38,311 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:51:38,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:51:38,312 INFO L85 PathProgramCache]: Analyzing trace with hash 307641716, now seen corresponding path program 1 times [2024-11-11 21:51:38,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:51:38,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764018271] [2024-11-11 21:51:38,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:51:38,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:51:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 21:51:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:51:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:51:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 21:51:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:51:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 21:51:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 21:51:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:51:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:51:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 21:51:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:51:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 21:51:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:51:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:51:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 21:51:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 21:51:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 21:51:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:51:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 21:51:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 21:51:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-11 21:51:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-11 21:51:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-11 21:51:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-11 21:51:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-11 21:51:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:38,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-11 21:51:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:39,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 21:51:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:39,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-11 21:51:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:39,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-11 21:51:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:39,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-11 21:51:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:39,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-11 21:51:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:39,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-11 21:51:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:39,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-11 21:51:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:39,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-11 21:51:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1264 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1263 trivial. 0 not checked. [2024-11-11 21:51:39,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:51:39,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764018271] [2024-11-11 21:51:39,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764018271] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:51:39,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579672950] [2024-11-11 21:51:39,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:51:39,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:51:39,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:51:39,042 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:51:39,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 21:51:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:39,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 1498 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:51:39,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:51:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1264 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1263 trivial. 0 not checked. [2024-11-11 21:51:39,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:51:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1264 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1263 trivial. 0 not checked. [2024-11-11 21:51:39,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579672950] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:51:39,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:51:39,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2024-11-11 21:51:39,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999722500] [2024-11-11 21:51:39,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:51:39,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:51:39,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:51:39,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:51:39,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:51:39,948 INFO L87 Difference]: Start difference. First operand 181 states and 260 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 6 states have internal predecessors, (110), 2 states have call successors, (69), 6 states have call predecessors, (69), 2 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2024-11-11 21:51:44,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-11 21:51:48,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-11 21:51:52,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-11 21:51:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:51:52,985 INFO L93 Difference]: Finished difference Result 378 states and 542 transitions. [2024-11-11 21:51:52,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:51:52,986 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 6 states have internal predecessors, (110), 2 states have call successors, (69), 6 states have call predecessors, (69), 2 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 225 [2024-11-11 21:51:52,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:51:52,988 INFO L225 Difference]: With dead ends: 378 [2024-11-11 21:51:52,988 INFO L226 Difference]: Without dead ends: 209 [2024-11-11 21:51:52,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 512 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:51:52,993 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 44 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 37 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:51:52,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 422 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 367 Invalid, 3 Unknown, 0 Unchecked, 12.9s Time] [2024-11-11 21:51:52,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-11 21:51:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 204. [2024-11-11 21:51:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 144 states have internal predecessors, (181), 49 states have call successors, (49), 10 states have call predecessors, (49), 12 states have return successors, (57), 49 states have call predecessors, (57), 49 states have call successors, (57) [2024-11-11 21:51:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 287 transitions. [2024-11-11 21:51:53,025 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 287 transitions. Word has length 225 [2024-11-11 21:51:53,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:51:53,027 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 287 transitions. [2024-11-11 21:51:53,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 6 states have internal predecessors, (110), 2 states have call successors, (69), 6 states have call predecessors, (69), 2 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2024-11-11 21:51:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 287 transitions. [2024-11-11 21:51:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-11 21:51:53,031 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:51:53,031 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 9, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:51:53,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 21:51:53,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:51:53,232 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:51:53,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:51:53,233 INFO L85 PathProgramCache]: Analyzing trace with hash -611364236, now seen corresponding path program 2 times [2024-11-11 21:51:53,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:51:53,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660415117] [2024-11-11 21:51:53,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:51:53,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:51:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 21:51:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:51:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:51:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 21:51:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:51:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 21:51:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 21:51:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:51:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:51:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 21:51:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:51:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 21:51:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:51:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:51:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:51:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 21:51:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 21:51:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-11 21:51:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-11 21:51:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-11 21:51:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-11 21:51:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-11 21:51:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-11 21:51:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 21:51:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-11 21:51:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-11 21:51:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-11 21:51:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-11 21:51:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-11 21:51:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-11 21:51:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-11 21:51:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-11 21:51:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-11 21:51:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-11 21:51:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:54,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1365 trivial. 0 not checked. [2024-11-11 21:51:54,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:51:54,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660415117] [2024-11-11 21:51:54,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660415117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:51:54,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:51:54,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:51:54,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684494144] [2024-11-11 21:51:54,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:51:54,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:51:54,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:51:54,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:51:54,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:51:54,478 INFO L87 Difference]: Start difference. First operand 204 states and 287 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-11 21:51:58,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-11 21:52:02,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-11 21:52:06,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-11 21:52:10,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-11 21:52:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:52:13,056 INFO L93 Difference]: Finished difference Result 534 states and 766 transitions. [2024-11-11 21:52:13,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:52:13,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 243 [2024-11-11 21:52:13,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:52:13,060 INFO L225 Difference]: With dead ends: 534 [2024-11-11 21:52:13,060 INFO L226 Difference]: Without dead ends: 377 [2024-11-11 21:52:13,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-11 21:52:13,061 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 179 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 58 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:52:13,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 721 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 694 Invalid, 4 Unknown, 0 Unchecked, 18.2s Time] [2024-11-11 21:52:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-11 21:52:13,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 366. [2024-11-11 21:52:13,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 245 states have (on average 1.2816326530612245) internal successors, (314), 250 states have internal predecessors, (314), 95 states have call successors, (95), 20 states have call predecessors, (95), 25 states have return successors, (118), 95 states have call predecessors, (118), 95 states have call successors, (118) [2024-11-11 21:52:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 527 transitions. [2024-11-11 21:52:13,123 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 527 transitions. Word has length 243 [2024-11-11 21:52:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:52:13,123 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 527 transitions. [2024-11-11 21:52:13,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-11 21:52:13,124 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 527 transitions. [2024-11-11 21:52:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-11 21:52:13,128 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:52:13,128 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 9, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:52:13,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:52:13,128 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:52:13,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:52:13,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1583191084, now seen corresponding path program 1 times [2024-11-11 21:52:13,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:52:13,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156023526] [2024-11-11 21:52:13,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:13,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:52:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:13,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:52:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 21:52:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 21:52:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 21:52:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:52:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 21:52:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 21:52:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:52:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:52:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 21:52:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 21:52:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-11 21:52:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-11 21:52:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-11 21:52:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-11 21:52:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-11 21:52:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-11 21:52:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 21:52:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-11 21:52:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-11 21:52:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-11 21:52:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-11 21:52:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-11 21:52:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-11 21:52:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-11 21:52:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-11 21:52:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-11 21:52:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-11 21:52:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1365 trivial. 0 not checked. [2024-11-11 21:52:14,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:52:14,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156023526] [2024-11-11 21:52:14,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156023526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:52:14,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:52:14,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:52:14,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297190333] [2024-11-11 21:52:14,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:52:14,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:52:14,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:52:14,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:52:14,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:52:14,189 INFO L87 Difference]: Start difference. First operand 366 states and 527 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-11 21:52:18,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-11 21:52:22,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-11 21:52:26,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-11 21:52:30,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-11 21:52:34,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-11 21:52:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:52:36,092 INFO L93 Difference]: Finished difference Result 663 states and 943 transitions. [2024-11-11 21:52:36,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:52:36,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 243 [2024-11-11 21:52:36,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:52:36,097 INFO L225 Difference]: With dead ends: 663 [2024-11-11 21:52:36,098 INFO L226 Difference]: Without dead ends: 335 [2024-11-11 21:52:36,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-11 21:52:36,102 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 228 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 173 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:52:36,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 677 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 562 Invalid, 5 Unknown, 0 Unchecked, 21.5s Time] [2024-11-11 21:52:36,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-11 21:52:36,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 327. [2024-11-11 21:52:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 219 states have (on average 1.2374429223744292) internal successors, (271), 223 states have internal predecessors, (271), 85 states have call successors, (85), 18 states have call predecessors, (85), 22 states have return successors, (99), 85 states have call predecessors, (99), 85 states have call successors, (99) [2024-11-11 21:52:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 455 transitions. [2024-11-11 21:52:36,146 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 455 transitions. Word has length 243 [2024-11-11 21:52:36,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:52:36,146 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 455 transitions. [2024-11-11 21:52:36,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-11 21:52:36,147 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 455 transitions. [2024-11-11 21:52:36,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-11 21:52:36,150 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:52:36,150 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 9, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:52:36,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:52:36,151 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:52:36,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:52:36,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1447908660, now seen corresponding path program 1 times [2024-11-11 21:52:36,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:52:36,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643997886] [2024-11-11 21:52:36,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:36,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:52:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:36,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:52:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 21:52:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 21:52:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 21:52:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:52:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 21:52:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 21:52:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:52:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:52:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 21:52:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 21:52:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-11 21:52:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-11 21:52:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-11 21:52:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-11 21:52:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-11 21:52:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-11 21:52:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 21:52:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-11 21:52:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-11 21:52:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-11 21:52:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-11 21:52:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-11 21:52:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-11 21:52:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-11 21:52:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-11 21:52:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-11 21:52:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-11 21:52:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1362 trivial. 0 not checked. [2024-11-11 21:52:37,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:52:37,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643997886] [2024-11-11 21:52:37,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643997886] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:52:37,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758989078] [2024-11-11 21:52:37,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:37,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:52:37,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:52:37,325 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:52:37,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 21:52:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:38,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 1784 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 21:52:38,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:52:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 1146 trivial. 0 not checked. [2024-11-11 21:52:38,324 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:52:38,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758989078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:52:38,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:52:38,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2024-11-11 21:52:38,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275602905] [2024-11-11 21:52:38,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:52:38,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:52:38,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:52:38,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:52:38,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:52:38,326 INFO L87 Difference]: Start difference. First operand 327 states and 455 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-11 21:52:39,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:52:39,136 INFO L93 Difference]: Finished difference Result 846 states and 1179 transitions. [2024-11-11 21:52:39,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:52:39,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 243 [2024-11-11 21:52:39,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:52:39,141 INFO L225 Difference]: With dead ends: 846 [2024-11-11 21:52:39,142 INFO L226 Difference]: Without dead ends: 544 [2024-11-11 21:52:39,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:52:39,144 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 251 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:52:39,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 502 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 21:52:39,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-11 21:52:39,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 530. [2024-11-11 21:52:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 347 states have (on average 1.1671469740634006) internal successors, (405), 349 states have internal predecessors, (405), 142 states have call successors, (142), 31 states have call predecessors, (142), 40 states have return successors, (174), 149 states have call predecessors, (174), 142 states have call successors, (174) [2024-11-11 21:52:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 721 transitions. [2024-11-11 21:52:39,239 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 721 transitions. Word has length 243 [2024-11-11 21:52:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:52:39,240 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 721 transitions. [2024-11-11 21:52:39,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-11 21:52:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 721 transitions. [2024-11-11 21:52:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-11 21:52:39,245 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:52:39,245 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 9, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:52:39,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 21:52:39,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:52:39,446 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:52:39,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:52:39,447 INFO L85 PathProgramCache]: Analyzing trace with hash -547394062, now seen corresponding path program 1 times [2024-11-11 21:52:39,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:52:39,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449474315] [2024-11-11 21:52:39,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:39,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:52:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:52:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 21:52:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 21:52:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 21:52:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:52:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 21:52:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 21:52:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:52:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:52:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 21:52:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 21:52:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-11 21:52:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-11 21:52:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-11 21:52:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-11 21:52:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-11 21:52:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-11 21:52:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 21:52:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-11 21:52:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-11 21:52:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-11 21:52:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-11 21:52:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-11 21:52:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-11 21:52:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-11 21:52:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-11 21:52:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-11 21:52:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-11 21:52:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1362 trivial. 0 not checked. [2024-11-11 21:52:40,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:52:40,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449474315] [2024-11-11 21:52:40,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449474315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:52:40,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833074556] [2024-11-11 21:52:40,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:40,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:52:40,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:52:40,581 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:52:40,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 21:52:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:41,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 1781 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 21:52:41,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:52:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 400 proven. 4 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2024-11-11 21:52:41,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:52:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1361 trivial. 0 not checked. [2024-11-11 21:52:42,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833074556] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:52:42,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:52:42,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 16 [2024-11-11 21:52:42,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473937188] [2024-11-11 21:52:42,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:52:42,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 21:52:42,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:52:42,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 21:52:42,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-11 21:52:42,307 INFO L87 Difference]: Start difference. First operand 530 states and 721 transitions. Second operand has 16 states, 16 states have (on average 6.3125) internal successors, (101), 12 states have internal predecessors, (101), 9 states have call successors, (63), 8 states have call predecessors, (63), 7 states have return successors, (61), 7 states have call predecessors, (61), 9 states have call successors, (61) [2024-11-11 21:52:46,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-11 21:52:50,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []