./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_lamport.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_lamport.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 d49d34698411f85a0a6e83adb869f73bcb1d6aade5262b0ab5e3122db7000276 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:51:49,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:51:49,163 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:49,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:51:49,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:51:49,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:51:49,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:51:49,185 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:51:49,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:51:49,185 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:51:49,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:51:49,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:51:49,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:51:49,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:51:49,186 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:51:49,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:51:49,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:51:49,189 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:51:49,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:51:49,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:51:49,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:51:49,192 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:51:49,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:51:49,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:51:49,192 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:51:49,193 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:51:49,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:51:49,193 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:51:49,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:51:49,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:51:49,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:51:49,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:51:49,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:51:49,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:51:49,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:51:49,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:51:49,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:51:49,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:51:49,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:51:49,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:51:49,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:51:49,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:51:49,196 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 -> d49d34698411f85a0a6e83adb869f73bcb1d6aade5262b0ab5e3122db7000276 [2024-11-11 21:51:49,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:51:49,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:51:49,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:51:49,397 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:51:49,397 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:51:49,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lamport.i [2024-11-11 21:51:50,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:51:50,849 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:51:50,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lamport.i [2024-11-11 21:51:50,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02ba0ac2/18557d2063734dfab2ad7b14ea59789f/FLAG9207b5a76 [2024-11-11 21:51:50,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e02ba0ac2/18557d2063734dfab2ad7b14ea59789f [2024-11-11 21:51:50,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:51:50,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:51:50,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:51:50,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:51:50,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:51:50,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:51:50" (1/1) ... [2024-11-11 21:51:50,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ebd71a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:50, skipping insertion in model container [2024-11-11 21:51:50,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:51:50" (1/1) ... [2024-11-11 21:51:50,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:51:51,208 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_lamport.i[23604,23617] [2024-11-11 21:51:51,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:51:51,338 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:51:51,371 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_lamport.i[23604,23617] [2024-11-11 21:51:51,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:51:51,457 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:51:51,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:51 WrapperNode [2024-11-11 21:51:51,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:51:51,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:51:51,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:51:51,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:51:51,464 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:51" (1/1) ... [2024-11-11 21:51:51,502 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:51" (1/1) ... [2024-11-11 21:51:51,565 INFO L138 Inliner]: procedures = 145, calls = 360, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 477 [2024-11-11 21:51:51,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:51:51,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:51:51,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:51:51,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:51:51,581 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:51" (1/1) ... [2024-11-11 21:51:51,581 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:51" (1/1) ... [2024-11-11 21:51:51,589 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:51" (1/1) ... [2024-11-11 21:51:51,661 INFO L175 MemorySlicer]: Split 168 memory accesses to 20 slices as follows [2, 8, 8, 8, 29, 21, 7, 13, 7, 7, 5, 7, 7, 13, 5, 5, 5, 5, 0, 6]. 17 percent of accesses are in the largest equivalence class. The 46 initializations are split as follows [2, 3, 3, 3, 9, 9, 3, 0, 3, 3, 0, 3, 3, 0, 0, 0, 0, 0, 0, 2]. The 42 writes are split as follows [0, 2, 2, 2, 11, 6, 2, 1, 2, 2, 1, 2, 2, 1, 1, 1, 1, 1, 0, 2]. [2024-11-11 21:51:51,661 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:51" (1/1) ... [2024-11-11 21:51:51,661 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:51" (1/1) ... [2024-11-11 21:51:51,690 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:51" (1/1) ... [2024-11-11 21:51:51,696 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:51" (1/1) ... [2024-11-11 21:51:51,708 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:51" (1/1) ... [2024-11-11 21:51:51,713 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:51" (1/1) ... [2024-11-11 21:51:51,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:51:51,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:51:51,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:51:51,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:51:51,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:51" (1/1) ... [2024-11-11 21:51:51,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:51:51,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:51:51,756 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:51,759 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:51,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 21:51:51,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 21:51:51,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-11 21:51:51,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-11 21:51:51,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-11 21:51:51,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-11 21:51:51,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-11 21:51:51,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-11 21:51:51,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-11 21:51:51,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-11 21:51:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-11 21:51:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-11 21:51:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-11 21:51:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-11 21:51:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-11 21:51:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-11 21:51:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-11-11 21:51:51,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-11-11 21:51:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2024-11-11 21:51:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2024-11-11 21:51:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 21:51:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 21:51:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-11 21:51:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-11 21:51:51,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-11 21:51:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-11 21:51:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-11 21:51:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-11 21:51:51,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-11 21:51:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-11 21:51:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-11 21:51:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-11 21:51:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-11 21:51:51,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-11 21:51:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-11 21:51:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-11 21:51:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-11-11 21:51:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-11-11 21:51:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2024-11-11 21:51:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2024-11-11 21:51:51,808 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-11 21:51:51,809 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-11 21:51:51,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:51:51,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 21:51:51,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-11 21:51:51,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-11 21:51:51,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-11 21:51:51,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-11 21:51:51,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-11 21:51:51,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-11 21:51:51,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-11 21:51:51,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-11 21:51:51,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-11 21:51:51,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-11 21:51:51,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-11 21:51:51,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-11 21:51:51,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-11 21:51:51,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-11 21:51:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-11 21:51:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-11-11 21:51:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-11-11 21:51:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2024-11-11 21:51:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2024-11-11 21:51:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2024-11-11 21:51:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-11-11 21:51:51,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-11-11 21:51:51,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-11 21:51:51,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-11 21:51:51,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-11 21:51:51,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-11 21:51:51,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-11 21:51:51,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-11 21:51:51,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-11 21:51:51,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-11 21:51:51,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-11 21:51:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-11 21:51:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-11 21:51:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-11 21:51:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-11 21:51:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-11 21:51:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-11 21:51:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-11-11 21:51:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-11-11 21:51:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2024-11-11 21:51:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2024-11-11 21:51:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2024-11-11 21:51:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-11-11 21:51:51,814 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-11-11 21:51:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-11 21:51:51,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-11 21:51:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 21:51:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-11 21:51:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-11 21:51:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-11 21:51:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-11 21:51:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-11 21:51:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-11 21:51:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-11 21:51:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-11 21:51:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-11 21:51:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-11 21:51:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-11 21:51:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-11-11 21:51:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-11-11 21:51:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-11-11 21:51:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-11-11 21:51:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-11-11 21:51:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-11-11 21:51:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2024-11-11 21:51:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2024-11-11 21:51:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2024-11-11 21:51:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-11-11 21:51:51,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-11-11 21:51:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:51:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 21:51:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 21:51:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 21:51:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-11 21:51:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-11 21:51:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-11 21:51:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-11 21:51:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-11 21:51:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-11 21:51:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-11 21:51:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-11 21:51:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-11 21:51:51,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-11 21:51:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-11 21:51:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-11 21:51:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-11 21:51:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-11 21:51:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-11 21:51:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-11 21:51:51,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:51:51,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:51:52,050 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:51:52,052 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:51:54,509 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-11 21:51:54,509 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:51:54,519 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:51:54,519 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 21:51:54,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:51:54 BoogieIcfgContainer [2024-11-11 21:51:54,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:51:54,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:51:54,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:51:54,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:51:54,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:51:50" (1/3) ... [2024-11-11 21:51:54,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be6efd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:51:54, skipping insertion in model container [2024-11-11 21:51:54,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:51:51" (2/3) ... [2024-11-11 21:51:54,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be6efd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:51:54, skipping insertion in model container [2024-11-11 21:51:54,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:51:54" (3/3) ... [2024-11-11 21:51:54,525 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_lamport.i [2024-11-11 21:51:54,537 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:51:54,537 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:51:54,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:51:54,627 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;@1d93af02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:51:54,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:51:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 75 states have internal predecessors, (97), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-11 21:51:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-11 21:51:54,650 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:51:54,651 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:51:54,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:51:54,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1573742471, now seen corresponding path program 1 times [2024-11-11 21:51:54,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:51:54,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919878937] [2024-11-11 21:51:54,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:51:54,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:51:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:51:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 21:51:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 21:51:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 21:51:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:51:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 21:51:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:51:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:51:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 21:51:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 21:51:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 21:51:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 21:51:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 21:51:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 21:51:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 21:51:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 21:51:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 21:51:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 21:51:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 21:51:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 21:51:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 21:51:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-11 21:51:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-11 21:51:55,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:51:55,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919878937] [2024-11-11 21:51:55,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919878937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:51:55,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:51:55,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:51:55,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997869531] [2024-11-11 21:51:55,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:51:55,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:51:55,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:51:55,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:51:55,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:51:55,292 INFO L87 Difference]: Start difference. First operand has 117 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 75 states have internal predecessors, (97), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-11 21:51:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:51:55,366 INFO L93 Difference]: Finished difference Result 236 states and 378 transitions. [2024-11-11 21:51:55,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:51:55,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-11-11 21:51:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:51:55,375 INFO L225 Difference]: With dead ends: 236 [2024-11-11 21:51:55,375 INFO L226 Difference]: Without dead ends: 117 [2024-11-11 21:51:55,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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:55,380 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 4 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:51:55,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 321 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:51:55,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-11 21:51:55,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2024-11-11 21:51:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-11 21:51:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-11 21:51:55,417 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 144 [2024-11-11 21:51:55,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:51:55,417 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-11 21:51:55,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-11 21:51:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-11 21:51:55,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:51:55,420 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:51:55,420 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:51:55,420 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:51:55,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:51:55,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1072773259, now seen corresponding path program 1 times [2024-11-11 21:51:55,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:51:55,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996424961] [2024-11-11 21:51:55,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:51:55,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:51:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:51:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:51:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:51:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 21:51:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 21:51:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:51:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:51:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 21:51:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 21:51:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:51:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 21:51:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 21:51:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 21:51:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 21:51:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 21:51:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 21:51:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 21:51:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 21:51:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:51:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 21:51:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 21:51:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-11 21:51:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-11 21:51:55,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:51:55,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996424961] [2024-11-11 21:51:55,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996424961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:51:55,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:51:55,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:51:55,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967316315] [2024-11-11 21:51:55,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:51:55,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:51:55,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:51:55,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:51:55,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:51:55,755 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-11 21:51:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:51:55,792 INFO L93 Difference]: Finished difference Result 227 states and 324 transitions. [2024-11-11 21:51:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:51:55,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-11-11 21:51:55,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:51:55,794 INFO L225 Difference]: With dead ends: 227 [2024-11-11 21:51:55,794 INFO L226 Difference]: Without dead ends: 116 [2024-11-11 21:51:55,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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:55,796 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 315 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:55,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 315 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:55,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-11 21:51:55,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-11 21:51:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-11 21:51:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-11 21:51:55,813 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 147 [2024-11-11 21:51:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:51:55,814 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-11 21:51:55,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-11 21:51:55,815 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-11 21:51:55,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-11 21:51:55,817 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:51:55,817 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:51:55,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:51:55,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:51:55,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1028614451, now seen corresponding path program 1 times [2024-11-11 21:51:55,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:51:55,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951519635] [2024-11-11 21:51:55,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:51:55,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:51:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:51:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 21:51:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 21:51:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 21:51:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 21:51:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 21:51:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:51:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:51:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 21:51:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 21:51:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:51:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 21:51:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 21:51:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 21:51:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 21:51:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 21:51:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 21:51:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 21:51:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 21:51:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-11 21:51:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-11 21:51:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 21:51:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-11 21:51:56,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:51:56,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951519635] [2024-11-11 21:51:56,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951519635] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:51:56,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565031069] [2024-11-11 21:51:56,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:51:56,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:51:56,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:51:56,079 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:56,080 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:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:56,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:51:56,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:51:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-11 21:51:56,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:51:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-11 21:51:56,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565031069] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:51:56,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:51:56,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-11 21:51:56,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950984393] [2024-11-11 21:51:56,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:51:56,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:51:56,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:51:56,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:51:56,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:51:56,625 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-11 21:51:56,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:51:56,675 INFO L93 Difference]: Finished difference Result 231 states and 329 transitions. [2024-11-11 21:51:56,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:51:56,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 149 [2024-11-11 21:51:56,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:51:56,678 INFO L225 Difference]: With dead ends: 231 [2024-11-11 21:51:56,678 INFO L226 Difference]: Without dead ends: 119 [2024-11-11 21:51:56,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 339 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:56,680 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:51:56,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 471 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:51:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-11 21:51:56,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-11 21:51:56,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 77 states have internal predecessors, (95), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-11 21:51:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2024-11-11 21:51:56,692 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 167 transitions. Word has length 149 [2024-11-11 21:51:56,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:51:56,692 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 167 transitions. [2024-11-11 21:51:56,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-11-11 21:51:56,692 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 167 transitions. [2024-11-11 21:51:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-11 21:51:56,699 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:51:56,699 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 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, 1, 1, 1, 1, 1, 1] [2024-11-11 21:51:56,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 21:51:56,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:51:56,900 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:51:56,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:51:56,900 INFO L85 PathProgramCache]: Analyzing trace with hash -829171247, now seen corresponding path program 2 times [2024-11-11 21:51:56,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:51:56,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357580858] [2024-11-11 21:51:56,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:51:56,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:51:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 21:51:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:51:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 21:51:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 21:51:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:51:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:51:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 21:51:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 21:51:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:51:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 21:51:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 21:51:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 21:51:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 21:51:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 21:51:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 21:51:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 21:51:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 21:51:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:51:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 21:51:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 21:51:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-11 21:51:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-11 21:51:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:57,162 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 933 trivial. 0 not checked. [2024-11-11 21:51:57,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:51:57,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357580858] [2024-11-11 21:51:57,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357580858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:51:57,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293001413] [2024-11-11 21:51:57,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 21:51:57,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:51:57,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:51:57,165 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:57,166 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:57,461 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-11 21:51:57,461 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:51:57,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 21:51:57,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:51:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 934 trivial. 0 not checked. [2024-11-11 21:51:57,718 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:51:57,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293001413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:51:57,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:51:57,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-11 21:51:57,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253392326] [2024-11-11 21:51:57,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:51:57,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:51:57,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:51:57,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:51:57,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:51:57,720 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-11 21:51:57,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:51:57,781 INFO L93 Difference]: Finished difference Result 223 states and 320 transitions. [2024-11-11 21:51:57,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:51:57,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2024-11-11 21:51:57,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:51:57,786 INFO L225 Difference]: With dead ends: 223 [2024-11-11 21:51:57,788 INFO L226 Difference]: Without dead ends: 173 [2024-11-11 21:51:57,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 196 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:57,789 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 74 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 496 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:57,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 496 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:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-11 21:51:57,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-11-11 21:51:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 113 states have (on average 1.2743362831858407) internal successors, (144), 113 states have internal predecessors, (144), 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:57,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 246 transitions. [2024-11-11 21:51:57,814 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 246 transitions. Word has length 153 [2024-11-11 21:51:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:51:57,818 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 246 transitions. [2024-11-11 21:51:57,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-11 21:51:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 246 transitions. [2024-11-11 21:51:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-11 21:51:57,820 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:51:57,820 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,838 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:58,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-11 21:51:58,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:51:58,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:51:58,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1805589549, now seen corresponding path program 1 times [2024-11-11 21:51:58,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:51:58,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894055177] [2024-11-11 21:51:58,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:51:58,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:51:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 21:51:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:51:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:51:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 21:51:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 21:51:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:51:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:51:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:51:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:51:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:51:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:51:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:51:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 21:51:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 21:51:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 21:51:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 21:51:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 21:51:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 21:51:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 21:51:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 21:51:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-11 21:51:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 21:51:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-11 21:51:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-11 21:51:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-11 21:51:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-11 21:51:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-11 21:51:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-11 21:51:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-11 21:51:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-11 21:51:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-11 21:51:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-11 21:51:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:51:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-11 21:51:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2024-11-11 21:51:58,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:51:58,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894055177] [2024-11-11 21:51:58,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894055177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:51:58,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219763263] [2024-11-11 21:51:58,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:51:58,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:51:58,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:51:58,511 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:58,513 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:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:51:58,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:51:58,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:51:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2024-11-11 21:51:59,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:51:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2024-11-11 21:51:59,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219763263] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:51:59,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:51:59,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2024-11-11 21:51:59,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609836660] [2024-11-11 21:51:59,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:51:59,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:51:59,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:51:59,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:51:59,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:51:59,212 INFO L87 Difference]: Start difference. First operand 173 states and 246 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (70), 6 states have call predecessors, (70), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2024-11-11 21:52:03,534 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:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:52:04,124 INFO L93 Difference]: Finished difference Result 362 states and 514 transitions. [2024-11-11 21:52:04,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:52:04,125 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (70), 6 states have call predecessors, (70), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 222 [2024-11-11 21:52:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:52:04,127 INFO L225 Difference]: With dead ends: 362 [2024-11-11 21:52:04,127 INFO L226 Difference]: Without dead ends: 201 [2024-11-11 21:52:04,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 506 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:52:04,128 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 74 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 145 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:52:04,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 578 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 406 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2024-11-11 21:52:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-11 21:52:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2024-11-11 21:52:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 134 states have (on average 1.2462686567164178) internal successors, (167), 136 states have internal predecessors, (167), 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:52:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 273 transitions. [2024-11-11 21:52:04,152 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 273 transitions. Word has length 222 [2024-11-11 21:52:04,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:52:04,152 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 273 transitions. [2024-11-11 21:52:04,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (70), 6 states have call predecessors, (70), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2024-11-11 21:52:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 273 transitions. [2024-11-11 21:52:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-11 21:52:04,155 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:52:04,155 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 9, 4, 4, 4, 4, 4, 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] [2024-11-11 21:52:04,170 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:52:04,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:52:04,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:52:04,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:52:04,356 INFO L85 PathProgramCache]: Analyzing trace with hash 624474195, now seen corresponding path program 2 times [2024-11-11 21:52:04,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:52:04,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957327906] [2024-11-11 21:52:04,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:04,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:52:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 21:52:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 21:52:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 21:52:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:52:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:52:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:52:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:52:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 21:52:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 21:52:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 21:52:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 21:52:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 21:52:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-11 21:52:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 21:52:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-11 21:52:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-11 21:52:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-11 21:52:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-11 21:52:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-11 21:52:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-11 21:52:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-11 21:52:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-11 21:52:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-11 21:52:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-11 21:52:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:52:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-11 21:52:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-11 21:52:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-11 21:52:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-11 21:52:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2024-11-11 21:52:05,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:52:05,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957327906] [2024-11-11 21:52:05,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957327906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:52:05,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:52:05,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:52:05,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787752254] [2024-11-11 21:52:05,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:52:05,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:52:05,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:52:05,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:52:05,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:52:05,295 INFO L87 Difference]: Start difference. First operand 196 states and 273 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-11 21:52:10,772 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:14,783 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:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:52:15,891 INFO L93 Difference]: Finished difference Result 510 states and 724 transitions. [2024-11-11 21:52:15,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:52:15,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 240 [2024-11-11 21:52:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:52:15,894 INFO L225 Difference]: With dead ends: 510 [2024-11-11 21:52:15,894 INFO L226 Difference]: Without dead ends: 361 [2024-11-11 21:52:15,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-11 21:52:15,896 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 159 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 54 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:52:15,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 728 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 706 Invalid, 2 Unknown, 0 Unchecked, 10.3s Time] [2024-11-11 21:52:15,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-11 21:52:15,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 350. [2024-11-11 21:52:15,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 229 states have (on average 1.2489082969432315) internal successors, (286), 234 states have internal predecessors, (286), 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:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 499 transitions. [2024-11-11 21:52:15,927 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 499 transitions. Word has length 240 [2024-11-11 21:52:15,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:52:15,927 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 499 transitions. [2024-11-11 21:52:15,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-11 21:52:15,928 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 499 transitions. [2024-11-11 21:52:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-11 21:52:15,930 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:52:15,930 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 9, 4, 4, 4, 4, 4, 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] [2024-11-11 21:52:15,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:52:15,930 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:52:15,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:52:15,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1274905475, now seen corresponding path program 1 times [2024-11-11 21:52:15,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:52:15,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625734843] [2024-11-11 21:52:15,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:15,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:52:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:52:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 21:52:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 21:52:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:52:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:52:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:52:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:52:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 21:52:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 21:52:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 21:52:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 21:52:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 21:52:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-11 21:52:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 21:52:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-11 21:52:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-11 21:52:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-11 21:52:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-11 21:52:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-11 21:52:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-11 21:52:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-11 21:52:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-11 21:52:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-11 21:52:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-11 21:52:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:52:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-11 21:52:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-11 21:52:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-11 21:52:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-11 21:52:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2024-11-11 21:52:16,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:52:16,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625734843] [2024-11-11 21:52:16,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625734843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:52:16,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:52:16,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:52:16,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898954939] [2024-11-11 21:52:16,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:52:16,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:52:16,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:52:16,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:52:16,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:52:16,700 INFO L87 Difference]: Start difference. First operand 350 states and 499 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-11 21:52:18,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-11 21:52:20,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-11 21:52:24,971 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:28,986 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:29,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:52:29,941 INFO L93 Difference]: Finished difference Result 637 states and 897 transitions. [2024-11-11 21:52:29,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:52:29,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 240 [2024-11-11 21:52:29,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:52:29,944 INFO L225 Difference]: With dead ends: 637 [2024-11-11 21:52:29,944 INFO L226 Difference]: Without dead ends: 325 [2024-11-11 21:52:29,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-11 21:52:29,945 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 190 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 135 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:52:29,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 676 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 571 Invalid, 2 Unknown, 0 Unchecked, 13.0s Time] [2024-11-11 21:52:29,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-11 21:52:29,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 317. [2024-11-11 21:52:29,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 208 states have (on average 1.2115384615384615) internal successors, (252), 212 states have internal predecessors, (252), 86 states have call successors, (86), 18 states have call predecessors, (86), 22 states have return successors, (100), 86 states have call predecessors, (100), 86 states have call successors, (100) [2024-11-11 21:52:29,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 438 transitions. [2024-11-11 21:52:29,974 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 438 transitions. Word has length 240 [2024-11-11 21:52:29,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:52:29,975 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 438 transitions. [2024-11-11 21:52:29,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-11 21:52:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 438 transitions. [2024-11-11 21:52:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-11 21:52:29,978 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:52:29,978 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 9, 4, 4, 4, 4, 4, 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] [2024-11-11 21:52:29,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:52:29,978 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:52:29,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:52:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1231711001, now seen corresponding path program 1 times [2024-11-11 21:52:29,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:52:29,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85079808] [2024-11-11 21:52:29,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:29,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:52:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:52:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 21:52:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 21:52:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:52:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:52:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:52:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:52:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 21:52:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 21:52:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 21:52:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 21:52:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 21:52:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-11 21:52:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 21:52:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-11 21:52:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-11 21:52:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-11 21:52:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-11 21:52:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-11 21:52:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-11 21:52:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-11 21:52:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-11 21:52:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-11 21:52:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-11 21:52:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:52:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-11 21:52:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-11 21:52:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-11 21:52:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-11 21:52:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1442 trivial. 0 not checked. [2024-11-11 21:52:30,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:52:30,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85079808] [2024-11-11 21:52:30,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85079808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:52:30,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478191792] [2024-11-11 21:52:30,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:30,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:52:30,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:52:30,853 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:30,854 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:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:31,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 1860 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 21:52:31,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:52:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 352 proven. 4 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2024-11-11 21:52:31,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:52:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1441 trivial. 0 not checked. [2024-11-11 21:52:31,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478191792] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:52:31,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:52:31,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 16 [2024-11-11 21:52:31,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731634349] [2024-11-11 21:52:31,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:52:31,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 21:52:31,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:52:31,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 21:52:31,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-11 21:52:31,842 INFO L87 Difference]: Start difference. First operand 317 states and 438 transitions. Second operand has 16 states, 16 states have (on average 5.8125) internal successors, (93), 12 states have internal predecessors, (93), 9 states have call successors, (64), 8 states have call predecessors, (64), 7 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) [2024-11-11 21:52:35,857 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:40,153 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:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:52:41,394 INFO L93 Difference]: Finished difference Result 617 states and 873 transitions. [2024-11-11 21:52:41,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 21:52:41,395 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 12 states have internal predecessors, (93), 9 states have call successors, (64), 8 states have call predecessors, (64), 7 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) Word has length 240 [2024-11-11 21:52:41,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:52:41,398 INFO L225 Difference]: With dead ends: 617 [2024-11-11 21:52:41,398 INFO L226 Difference]: Without dead ends: 337 [2024-11-11 21:52:41,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 547 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2024-11-11 21:52:41,401 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 248 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 202 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:52:41,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 635 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 632 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2024-11-11 21:52:41,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-11 21:52:41,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 330. [2024-11-11 21:52:41,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 222 states have (on average 1.2387387387387387) internal successors, (275), 226 states have internal predecessors, (275), 77 states have call successors, (77), 26 states have call predecessors, (77), 30 states have return successors, (101), 77 states have call predecessors, (101), 77 states have call successors, (101) [2024-11-11 21:52:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 453 transitions. [2024-11-11 21:52:41,429 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 453 transitions. Word has length 240 [2024-11-11 21:52:41,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:52:41,430 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 453 transitions. [2024-11-11 21:52:41,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 12 states have internal predecessors, (93), 9 states have call successors, (64), 8 states have call predecessors, (64), 7 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) [2024-11-11 21:52:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 453 transitions. [2024-11-11 21:52:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-11 21:52:41,433 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:52:41,433 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 9, 4, 4, 4, 4, 4, 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] [2024-11-11 21:52:41,452 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:41,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:52:41,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:52:41,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:52:41,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1969115449, now seen corresponding path program 1 times [2024-11-11 21:52:41,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:52:41,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429545457] [2024-11-11 21:52:41,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:41,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:52:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:43,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:52:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:43,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:43,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 21:52:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 21:52:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:52:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:52:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:52:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:52:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 21:52:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 21:52:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 21:52:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 21:52:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 21:52:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 21:52:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-11 21:52:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 21:52:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-11 21:52:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-11 21:52:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-11 21:52:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-11 21:52:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-11 21:52:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-11 21:52:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-11 21:52:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-11 21:52:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-11 21:52:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-11 21:52:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:52:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-11 21:52:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-11 21:52:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-11 21:52:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-11 21:52:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1442 trivial. 0 not checked. [2024-11-11 21:52:44,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:52:44,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429545457] [2024-11-11 21:52:44,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429545457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:52:44,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666478043] [2024-11-11 21:52:44,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:52:44,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:52:44,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:52:44,336 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:44,337 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:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:52:44,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-11 21:52:44,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:52:45,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-11 21:52:48,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 21:52:48,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 21:52:48,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2024-11-11 21:52:51,641 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2024-11-11 21:52:51,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104 [2024-11-11 21:53:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 397 proven. 4 refuted. 0 times theorem prover too weak. 1044 trivial. 0 not checked. [2024-11-11 21:53:07,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:53:08,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2024-11-11 21:53:08,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2024-11-11 21:53:08,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-11 21:53:08,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2024-11-11 21:53:08,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-11 21:53:08,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2024-11-11 21:53:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1441 trivial. 0 not checked. [2024-11-11 21:53:08,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666478043] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:53:08,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:53:08,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 9] total 39 [2024-11-11 21:53:08,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802962752] [2024-11-11 21:53:08,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:53:08,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-11 21:53:08,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:53:08,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-11 21:53:08,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1336, Unknown=1, NotChecked=0, Total=1482 [2024-11-11 21:53:08,662 INFO L87 Difference]: Start difference. First operand 330 states and 453 transitions. Second operand has 39 states, 36 states have (on average 4.055555555555555) internal successors, (146), 35 states have internal predecessors, (146), 19 states have call successors, (72), 13 states have call predecessors, (72), 14 states have return successors, (72), 17 states have call predecessors, (72), 19 states have call successors, (72) [2024-11-11 21:53:12,822 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:53:17,365 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:53:21,373 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:53:25,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []