./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 4ba4618d2c12b624306627073ace8aff518621333cf7d938808dd7313f83bbaa --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:40:29,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:40:30,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:40:30,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:40:30,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:40:30,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:40:30,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:40:30,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:40:30,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:40:30,103 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:40:30,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:40:30,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:40:30,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:40:30,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:40:30,106 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:40:30,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:40:30,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:40:30,108 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:40:30,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:40:30,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:40:30,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:40:30,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:40:30,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:40:30,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:40:30,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:40:30,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:40:30,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:40:30,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:40:30,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:40:30,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:40:30,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:40:30,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:40:30,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:40:30,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:40:30,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:40:30,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:40:30,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:40:30,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:40:30,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:40:30,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:40:30,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:40:30,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:40:30,119 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-clean/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-clean/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 -> 4ba4618d2c12b624306627073ace8aff518621333cf7d938808dd7313f83bbaa [2024-10-11 13:40:30,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:40:30,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:40:30,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:40:30,441 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:40:30,442 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:40:30,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i [2024-10-11 13:40:31,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:40:32,136 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:40:32,138 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i [2024-10-11 13:40:32,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cf7f7a000/c29269b4b97542669d4a158b98001a7e/FLAG521a6df7e [2024-10-11 13:40:32,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cf7f7a000/c29269b4b97542669d4a158b98001a7e [2024-10-11 13:40:32,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:40:32,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:40:32,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:40:32,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:40:32,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:40:32,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:40:32" (1/1) ... [2024-10-11 13:40:32,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6934bc6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:32, skipping insertion in model container [2024-10-11 13:40:32,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:40:32" (1/1) ... [2024-10-11 13:40:32,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:40:32,395 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i[916,929] [2024-10-11 13:40:32,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:40:32,496 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:40:32,510 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-64.i[916,929] [2024-10-11 13:40:32,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:40:32,580 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:40:32,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:32 WrapperNode [2024-10-11 13:40:32,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:40:32,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:40:32,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:40:32,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:40:32,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:32" (1/1) ... [2024-10-11 13:40:32,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:32" (1/1) ... [2024-10-11 13:40:32,651 INFO L138 Inliner]: procedures = 29, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 558 [2024-10-11 13:40:32,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:40:32,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:40:32,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:40:32,652 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:40:32,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:32" (1/1) ... [2024-10-11 13:40:32,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:32" (1/1) ... [2024-10-11 13:40:32,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:32" (1/1) ... [2024-10-11 13:40:32,716 INFO L175 MemorySlicer]: Split 131 memory accesses to 16 slices as follows [2, 15, 6, 10, 11, 8, 8, 8, 10, 7, 6, 8, 3, 12, 7, 10]. 11 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1]. [2024-10-11 13:40:32,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:32" (1/1) ... [2024-10-11 13:40:32,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:32" (1/1) ... [2024-10-11 13:40:32,738 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:32" (1/1) ... [2024-10-11 13:40:32,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:32" (1/1) ... [2024-10-11 13:40:32,754 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:32" (1/1) ... [2024-10-11 13:40:32,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:32" (1/1) ... [2024-10-11 13:40:32,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:40:32,768 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:40:32,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:40:32,768 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:40:32,769 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:32" (1/1) ... [2024-10-11 13:40:32,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:40:32,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:40:32,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:40:32,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:40:32,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:40:32,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:40:32,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:40:32,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:40:32,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:40:32,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:40:32,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:40:32,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 13:40:32,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 13:40:32,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 13:40:32,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 13:40:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 13:40:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 13:40:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 13:40:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-11 13:40:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-11 13:40:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-11 13:40:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:40:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:40:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:40:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:40:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:40:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:40:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-11 13:40:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-11 13:40:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-11 13:40:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-11 13:40:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-11 13:40:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-11 13:40:32,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-11 13:40:32,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-11 13:40:32,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-11 13:40:32,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-10-11 13:40:32,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:40:32,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:40:32,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:40:32,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:40:32,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:40:32,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:40:32,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-11 13:40:32,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-11 13:40:32,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-11 13:40:32,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-11 13:40:32,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-11 13:40:32,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-11 13:40:32,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-11 13:40:32,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-11 13:40:32,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-11 13:40:32,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-10-11 13:40:32,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:40:32,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:40:32,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:40:32,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:40:32,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:40:32,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:40:32,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 13:40:32,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 13:40:32,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 13:40:32,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 13:40:32,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 13:40:32,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 13:40:32,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 13:40:32,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-11 13:40:32,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-11 13:40:32,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-11 13:40:32,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:40:32,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:40:32,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:40:32,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:40:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:40:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:40:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-11 13:40:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-11 13:40:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-11 13:40:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-11 13:40:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-11 13:40:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-11 13:40:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-11 13:40:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-11 13:40:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-11 13:40:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-10-11 13:40:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:40:32,890 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:40:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:40:32,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:40:32,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:40:32,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:40:32,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:40:32,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:40:32,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 13:40:32,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 13:40:32,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 13:40:32,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 13:40:32,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 13:40:32,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 13:40:32,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 13:40:32,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 13:40:32,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 13:40:32,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 13:40:32,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:40:32,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:40:33,173 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:40:33,175 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:40:33,802 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2024-10-11 13:40:33,802 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:40:33,853 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:40:33,856 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:40:33,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:40:33 BoogieIcfgContainer [2024-10-11 13:40:33,857 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:40:33,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:40:33,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:40:33,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:40:33,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:40:32" (1/3) ... [2024-10-11 13:40:33,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b9c8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:40:33, skipping insertion in model container [2024-10-11 13:40:33,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:40:32" (2/3) ... [2024-10-11 13:40:33,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b9c8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:40:33, skipping insertion in model container [2024-10-11 13:40:33,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:40:33" (3/3) ... [2024-10-11 13:40:33,867 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-64.i [2024-10-11 13:40:33,884 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:40:33,885 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:40:33,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:40:33,974 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;@4c40d520, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:40:33,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:40:33,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 100 states have internal predecessors, (145), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:40:33,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 13:40:33,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:33,999 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:34,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:34,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:34,013 INFO L85 PathProgramCache]: Analyzing trace with hash 938953730, now seen corresponding path program 1 times [2024-10-11 13:40:34,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:40:34,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374088294] [2024-10-11 13:40:34,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:34,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:40:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:40:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:40:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:40:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:40:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:40:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:40:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:40:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:40:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:40:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:40:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:40:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:40:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:40:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:40:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:40:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:40:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:40:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:40:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:40:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:40:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:40:34,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:40:34,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374088294] [2024-10-11 13:40:34,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374088294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:40:34,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:40:34,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:40:34,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661445611] [2024-10-11 13:40:34,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:40:34,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:40:34,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:40:34,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:40:34,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:40:34,615 INFO L87 Difference]: Start difference. First operand has 122 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 100 states have internal predecessors, (145), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:40:34,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:34,670 INFO L93 Difference]: Finished difference Result 241 states and 388 transitions. [2024-10-11 13:40:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:40:34,675 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2024-10-11 13:40:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:34,684 INFO L225 Difference]: With dead ends: 241 [2024-10-11 13:40:34,684 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 13:40:34,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:40:34,693 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:34,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:40:34,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 13:40:34,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-11 13:40:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 98 states have internal predecessors, (140), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:40:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 180 transitions. [2024-10-11 13:40:34,756 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 180 transitions. Word has length 154 [2024-10-11 13:40:34,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:34,757 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 180 transitions. [2024-10-11 13:40:34,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:40:34,757 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 180 transitions. [2024-10-11 13:40:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 13:40:34,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:34,765 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:34,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:40:34,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:34,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:34,766 INFO L85 PathProgramCache]: Analyzing trace with hash 405407330, now seen corresponding path program 1 times [2024-10-11 13:40:34,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:40:34,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836376423] [2024-10-11 13:40:34,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:34,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:40:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:40:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:40:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:40:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:40:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:40:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:40:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:40:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:40:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:40:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:40:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:40:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:40:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:40:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:40:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:40:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:40:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:40:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:40:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:40:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:40:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:40:35,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:40:35,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836376423] [2024-10-11 13:40:35,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836376423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:40:35,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:40:35,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:40:35,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034582971] [2024-10-11 13:40:35,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:40:35,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:40:35,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:40:35,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:40:35,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:40:35,242 INFO L87 Difference]: Start difference. First operand 120 states and 180 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:40:35,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:35,305 INFO L93 Difference]: Finished difference Result 241 states and 362 transitions. [2024-10-11 13:40:35,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:40:35,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2024-10-11 13:40:35,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:35,308 INFO L225 Difference]: With dead ends: 241 [2024-10-11 13:40:35,308 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 13:40:35,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:40:35,310 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:35,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:40:35,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 13:40:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-11 13:40:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.42) internal successors, (142), 100 states have internal predecessors, (142), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:40:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 182 transitions. [2024-10-11 13:40:35,334 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 182 transitions. Word has length 154 [2024-10-11 13:40:35,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:35,339 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 182 transitions. [2024-10-11 13:40:35,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:40:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 182 transitions. [2024-10-11 13:40:35,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 13:40:35,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:35,341 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:35,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:40:35,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:35,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:35,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1712549728, now seen corresponding path program 1 times [2024-10-11 13:40:35,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:40:35,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845897068] [2024-10-11 13:40:35,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:35,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:40:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:40:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:40:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:40:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:40:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:40:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:40:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:40:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:40:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:40:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:40:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:40:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:40:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:40:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:40:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:40:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:40:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:40:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:40:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:40:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:40:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:40:35,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:40:35,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845897068] [2024-10-11 13:40:35,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845897068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:40:35,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:40:35,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:40:35,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147126003] [2024-10-11 13:40:35,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:40:35,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:40:35,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:40:35,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:40:35,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:40:35,735 INFO L87 Difference]: Start difference. First operand 122 states and 182 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:40:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:35,788 INFO L93 Difference]: Finished difference Result 245 states and 366 transitions. [2024-10-11 13:40:35,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:40:35,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-10-11 13:40:35,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:35,790 INFO L225 Difference]: With dead ends: 245 [2024-10-11 13:40:35,791 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 13:40:35,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:40:35,792 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:35,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:40:35,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 13:40:35,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-11 13:40:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 102 states have (on average 1.411764705882353) internal successors, (144), 102 states have internal predecessors, (144), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:40:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2024-10-11 13:40:35,802 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 154 [2024-10-11 13:40:35,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:35,802 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2024-10-11 13:40:35,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:40:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2024-10-11 13:40:35,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 13:40:35,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:35,805 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:35,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:40:35,805 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:35,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:35,806 INFO L85 PathProgramCache]: Analyzing trace with hash -661838834, now seen corresponding path program 1 times [2024-10-11 13:40:35,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:40:35,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87706715] [2024-10-11 13:40:35,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:35,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:40:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:40:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:40:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:40:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:40:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:40:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:40:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:40:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:40:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:40:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:40:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:40:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:40:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:40:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:40:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:40:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:40:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:40:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:40:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:40:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:40:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,198 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:40:36,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:40:36,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87706715] [2024-10-11 13:40:36,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87706715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:40:36,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:40:36,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:40:36,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849583667] [2024-10-11 13:40:36,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:40:36,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:40:36,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:40:36,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:40:36,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:40:36,201 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:40:36,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:36,252 INFO L93 Difference]: Finished difference Result 250 states and 371 transitions. [2024-10-11 13:40:36,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:40:36,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-10-11 13:40:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:36,256 INFO L225 Difference]: With dead ends: 250 [2024-10-11 13:40:36,256 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 13:40:36,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:40:36,260 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:36,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 681 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:40:36,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 13:40:36,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-10-11 13:40:36,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:40:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 187 transitions. [2024-10-11 13:40:36,272 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 187 transitions. Word has length 156 [2024-10-11 13:40:36,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:36,273 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 187 transitions. [2024-10-11 13:40:36,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:40:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 187 transitions. [2024-10-11 13:40:36,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 13:40:36,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:36,275 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:36,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:40:36,276 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:36,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:36,276 INFO L85 PathProgramCache]: Analyzing trace with hash -491697587, now seen corresponding path program 1 times [2024-10-11 13:40:36,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:40:36,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290488895] [2024-10-11 13:40:36,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:36,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:40:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:40:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:40:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:40:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:40:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:40:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:40:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:36,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:40:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:37,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:40:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:37,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:40:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:37,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:40:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:37,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:40:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:37,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:40:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:37,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:40:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:37,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:40:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:37,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:40:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:37,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:40:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:37,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:40:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:37,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:40:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:37,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:40:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:37,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:40:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:40:37,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:40:37,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290488895] [2024-10-11 13:40:37,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290488895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:40:37,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:40:37,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:40:37,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880452680] [2024-10-11 13:40:37,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:40:37,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:40:37,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:40:37,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:40:37,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:40:37,069 INFO L87 Difference]: Start difference. First operand 127 states and 187 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:40:37,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:37,519 INFO L93 Difference]: Finished difference Result 478 states and 700 transitions. [2024-10-11 13:40:37,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:40:37,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2024-10-11 13:40:37,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:37,522 INFO L225 Difference]: With dead ends: 478 [2024-10-11 13:40:37,522 INFO L226 Difference]: Without dead ends: 352 [2024-10-11 13:40:37,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:40:37,524 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 378 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:37,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 848 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:40:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-11 13:40:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 144. [2024-10-11 13:40:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.4180327868852458) internal successors, (173), 122 states have internal predecessors, (173), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:40:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2024-10-11 13:40:37,537 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 157 [2024-10-11 13:40:37,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:37,538 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2024-10-11 13:40:37,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:40:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2024-10-11 13:40:37,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 13:40:37,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:37,540 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:37,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:40:37,540 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:37,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:37,541 INFO L85 PathProgramCache]: Analyzing trace with hash -786118807, now seen corresponding path program 1 times [2024-10-11 13:40:37,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:40:37,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551522853] [2024-10-11 13:40:37,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:40:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:40:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:40:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:40:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:40:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:40:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:40:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:40:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:40:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:40:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:40:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:40:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:40:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:40:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:40:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:40:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:40:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:40:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:40:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:40:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:40:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-11 13:40:38,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:40:38,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551522853] [2024-10-11 13:40:38,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551522853] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:40:38,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457265203] [2024-10-11 13:40:38,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:38,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:40:38,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:40:38,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:40:38,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:40:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:38,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 13:40:38,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:40:39,022 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 15 treesize of output 1 [2024-10-11 13:40:39,419 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 17 treesize of output 9 [2024-10-11 13:40:39,446 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 17 proven. 195 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-10-11 13:40:39,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:40:40,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457265203] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:40:40,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:40:40,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2024-10-11 13:40:40,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838956678] [2024-10-11 13:40:40,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:40:40,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 13:40:40,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:40:40,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 13:40:40,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:40:40,035 INFO L87 Difference]: Start difference. First operand 144 states and 213 transitions. Second operand has 14 states, 12 states have (on average 9.583333333333334) internal successors, (115), 13 states have internal predecessors, (115), 6 states have call successors, (40), 3 states have call predecessors, (40), 4 states have return successors, (40), 5 states have call predecessors, (40), 6 states have call successors, (40) [2024-10-11 13:40:41,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:41,242 INFO L93 Difference]: Finished difference Result 422 states and 618 transitions. [2024-10-11 13:40:41,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 13:40:41,243 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 9.583333333333334) internal successors, (115), 13 states have internal predecessors, (115), 6 states have call successors, (40), 3 states have call predecessors, (40), 4 states have return successors, (40), 5 states have call predecessors, (40), 6 states have call successors, (40) Word has length 158 [2024-10-11 13:40:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:41,247 INFO L225 Difference]: With dead ends: 422 [2024-10-11 13:40:41,247 INFO L226 Difference]: Without dead ends: 262 [2024-10-11 13:40:41,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=254, Invalid=1078, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 13:40:41,250 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 681 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:41,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 1234 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:40:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-11 13:40:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 129. [2024-10-11 13:40:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:40:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 186 transitions. [2024-10-11 13:40:41,302 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 186 transitions. Word has length 158 [2024-10-11 13:40:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:41,302 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 186 transitions. [2024-10-11 13:40:41,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 9.583333333333334) internal successors, (115), 13 states have internal predecessors, (115), 6 states have call successors, (40), 3 states have call predecessors, (40), 4 states have return successors, (40), 5 states have call predecessors, (40), 6 states have call successors, (40) [2024-10-11 13:40:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 186 transitions. [2024-10-11 13:40:41,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 13:40:41,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:41,305 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:41,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:40:41,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:40:41,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:41,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:41,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1568549287, now seen corresponding path program 1 times [2024-10-11 13:40:41,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:40:41,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118921155] [2024-10-11 13:40:41,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:41,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:40:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:40:41,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [438781277] [2024-10-11 13:40:41,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:41,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:40:41,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:40:41,689 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:40:41,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 13:40:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:40:42,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 13:40:42,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:40:42,435 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 15 treesize of output 1 [2024-10-11 13:40:43,040 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 13 proven. 375 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-10-11 13:40:43,040 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:40:43,689 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 52 treesize of output 48 [2024-10-11 13:40:43,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:40:43,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118921155] [2024-10-11 13:40:43,806 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 13:40:43,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438781277] [2024-10-11 13:40:43,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438781277] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:40:43,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:40:43,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-11 13:40:43,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741175245] [2024-10-11 13:40:43,808 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 13:40:43,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:40:43,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:40:43,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:40:43,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:40:43,810 INFO L87 Difference]: Start difference. First operand 129 states and 186 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:40:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:40:44,396 INFO L93 Difference]: Finished difference Result 394 states and 564 transitions. [2024-10-11 13:40:44,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 13:40:44,397 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 159 [2024-10-11 13:40:44,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:40:44,399 INFO L225 Difference]: With dead ends: 394 [2024-10-11 13:40:44,399 INFO L226 Difference]: Without dead ends: 266 [2024-10-11 13:40:44,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=582, Unknown=0, NotChecked=0, Total=812 [2024-10-11 13:40:44,401 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 314 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:40:44,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1252 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:40:44,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-11 13:40:44,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 206. [2024-10-11 13:40:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 160 states have (on average 1.325) internal successors, (212), 160 states have internal predecessors, (212), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:40:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 292 transitions. [2024-10-11 13:40:44,434 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 292 transitions. Word has length 159 [2024-10-11 13:40:44,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:40:44,435 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 292 transitions. [2024-10-11 13:40:44,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:40:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 292 transitions. [2024-10-11 13:40:44,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 13:40:44,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:40:44,437 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:40:44,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 13:40:44,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:40:44,639 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:40:44,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:40:44,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1434535781, now seen corresponding path program 1 times [2024-10-11 13:40:44,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:40:44,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965832984] [2024-10-11 13:40:44,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:40:44,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:40:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat