./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/bin/uautomizer-verify-4GaUIPS5ZU --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 a71ef89e0c9f3635b059609e166e2ca02077ae52d17a785a0f63b8520dafcb51 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:57:40,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:57:41,062 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 21:57:41,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:57:41,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:57:41,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:57:41,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:57:41,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:57:41,116 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:57:41,117 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:57:41,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:57:41,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:57:41,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:57:41,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:57:41,121 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:57:41,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:57:41,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:57:41,126 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:57:41,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:57:41,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:57:41,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:57:41,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:57:41,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:57:41,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:57:41,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:57:41,132 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:57:41,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:57:41,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:57:41,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:57:41,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:57:41,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:57:41,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:57:41,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:41,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:57:41,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:57:41,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:57:41,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:57:41,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:57:41,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:57:41,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:57:41,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:57:41,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:57:41,140 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/bin/uautomizer-verify-4GaUIPS5ZU 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 -> a71ef89e0c9f3635b059609e166e2ca02077ae52d17a785a0f63b8520dafcb51 [2024-10-31 21:57:41,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:57:41,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:57:41,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:57:41,453 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:57:41,454 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:57:41,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i Unable to find full path for "g++" [2024-10-31 21:57:43,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:57:43,737 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:57:43,737 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i [2024-10-31 21:57:43,752 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/bin/uautomizer-verify-4GaUIPS5ZU/data/96acf3c80/3b55522164ae4ffa952a91dd87b00b0e/FLAG37fe98ea8 [2024-10-31 21:57:43,773 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/bin/uautomizer-verify-4GaUIPS5ZU/data/96acf3c80/3b55522164ae4ffa952a91dd87b00b0e [2024-10-31 21:57:43,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:57:43,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:57:43,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:43,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:57:43,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:57:43,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:43" (1/1) ... [2024-10-31 21:57:43,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b684a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:43, skipping insertion in model container [2024-10-31 21:57:43,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:43" (1/1) ... [2024-10-31 21:57:43,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:57:44,084 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i[916,929] [2024-10-31 21:57:44,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:44,161 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:57:44,175 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i[916,929] [2024-10-31 21:57:44,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:44,237 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:57:44,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44 WrapperNode [2024-10-31 21:57:44,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:44,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:44,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:57:44,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:57:44,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,322 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 554 [2024-10-31 21:57:44,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:44,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:57:44,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:57:44,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:57:44,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,388 INFO L175 MemorySlicer]: Split 132 memory accesses to 15 slices as follows [2, 7, 8, 18, 3, 5, 5, 10, 8, 8, 8, 35, 6, 3, 6]. 27 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-10-31 21:57:44,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,389 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,409 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:57:44,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:57:44,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:57:44,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:57:44,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (1/1) ... [2024-10-31 21:57:44,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:44,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:44,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:57:44,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94557d22-79e1-409a-8162-ad1ec6262163/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:57:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:57:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-31 21:57:44,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-31 21:57:44,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-31 21:57:44,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-31 21:57:44,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-31 21:57:44,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-31 21:57:44,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-31 21:57:44,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-31 21:57:44,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-31 21:57:44,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-31 21:57:44,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-31 21:57:44,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-31 21:57:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-31 21:57:44,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-31 21:57:44,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-31 21:57:44,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 21:57:44,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 21:57:44,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 21:57:44,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-31 21:57:44,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-31 21:57:44,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-31 21:57:44,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-31 21:57:44,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-31 21:57:44,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-31 21:57:44,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-31 21:57:44,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-31 21:57:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-31 21:57:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-31 21:57:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-31 21:57:44,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-31 21:57:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-31 21:57:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-31 21:57:44,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-31 21:57:44,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-31 21:57:44,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-31 21:57:44,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-31 21:57:44,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-31 21:57:44,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-31 21:57:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-31 21:57:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-31 21:57:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-31 21:57:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-31 21:57:44,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-31 21:57:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-31 21:57:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-31 21:57:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 21:57:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 21:57:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 21:57:44,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-31 21:57:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-31 21:57:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-31 21:57:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-31 21:57:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-31 21:57:44,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-31 21:57:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-31 21:57:44,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-31 21:57:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-31 21:57:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-31 21:57:44,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-31 21:57:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-31 21:57:44,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-31 21:57:44,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-31 21:57:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-31 21:57:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-31 21:57:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-31 21:57:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-31 21:57:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-31 21:57:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-31 21:57:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-31 21:57:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-31 21:57:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-31 21:57:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-31 21:57:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-31 21:57:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-31 21:57:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-31 21:57:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:57:44,553 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:57:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:57:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 21:57:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 21:57:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-31 21:57:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-31 21:57:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-31 21:57:44,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-31 21:57:44,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-31 21:57:44,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-31 21:57:44,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-31 21:57:44,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-31 21:57:44,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-31 21:57:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-31 21:57:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-31 21:57:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-31 21:57:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:57:44,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:57:44,833 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:57:44,837 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:57:45,573 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-10-31 21:57:45,573 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:57:45,594 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:57:45,594 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:57:45,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:45 BoogieIcfgContainer [2024-10-31 21:57:45,596 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:57:45,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:57:45,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:57:45,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:57:45,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:57:43" (1/3) ... [2024-10-31 21:57:45,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2121d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:45, skipping insertion in model container [2024-10-31 21:57:45,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:44" (2/3) ... [2024-10-31 21:57:45,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2121d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:45, skipping insertion in model container [2024-10-31 21:57:45,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:45" (3/3) ... [2024-10-31 21:57:45,608 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-70.i [2024-10-31 21:57:45,629 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:57:45,629 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:57:45,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:57:45,721 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;@63c7dc9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:57:45,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:57:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 21:57:45,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-31 21:57:45,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:45,744 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:57:45,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:45,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:45,753 INFO L85 PathProgramCache]: Analyzing trace with hash 521439153, now seen corresponding path program 1 times [2024-10-31 21:57:45,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:45,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503869393] [2024-10-31 21:57:45,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:45,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 21:57:46,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503869393] [2024-10-31 21:57:46,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503869393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:46,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:46,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:57:46,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531254836] [2024-10-31 21:57:46,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:46,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:57:46,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:46,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:57:46,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:57:46,350 INFO L87 Difference]: Start difference. First operand has 111 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 21:57:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:46,385 INFO L93 Difference]: Finished difference Result 215 states and 330 transitions. [2024-10-31 21:57:46,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:57:46,388 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2024-10-31 21:57:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:46,399 INFO L225 Difference]: With dead ends: 215 [2024-10-31 21:57:46,399 INFO L226 Difference]: Without dead ends: 107 [2024-10-31 21:57:46,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-31 21:57:46,406 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:46,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-31 21:57:46,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-31 21:57:46,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 21:57:46,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2024-10-31 21:57:46,474 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 116 [2024-10-31 21:57:46,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:46,475 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2024-10-31 21:57:46,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 21:57:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2024-10-31 21:57:46,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-31 21:57:46,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:46,480 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:57:46,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:57:46,481 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:46,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:46,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1453723071, now seen corresponding path program 1 times [2024-10-31 21:57:46,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:46,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409006062] [2024-10-31 21:57:46,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:46,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 21:57:46,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:46,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409006062] [2024-10-31 21:57:46,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409006062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:46,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:46,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:46,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110643764] [2024-10-31 21:57:46,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:46,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:57:46,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:46,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:57:46,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:46,959 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 21:57:47,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:47,028 INFO L93 Difference]: Finished difference Result 213 states and 310 transitions. [2024-10-31 21:57:47,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:57:47,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2024-10-31 21:57:47,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:47,030 INFO L225 Difference]: With dead ends: 213 [2024-10-31 21:57:47,031 INFO L226 Difference]: Without dead ends: 109 [2024-10-31 21:57:47,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-31 21:57:47,035 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:47,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-31 21:57:47,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-31 21:57:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 21:57:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-10-31 21:57:47,062 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 116 [2024-10-31 21:57:47,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:47,063 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-10-31 21:57:47,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-31 21:57:47,064 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-10-31 21:57:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-31 21:57:47,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:47,069 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:57:47,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:57:47,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:47,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:47,070 INFO L85 PathProgramCache]: Analyzing trace with hash -961096897, now seen corresponding path program 1 times [2024-10-31 21:57:47,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:47,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285353367] [2024-10-31 21:57:47,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:47,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 21:57:47,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:47,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285353367] [2024-10-31 21:57:47,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285353367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:47,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:47,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:47,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788425883] [2024-10-31 21:57:47,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:47,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:57:47,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:47,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:57:47,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:47,530 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:57:47,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:47,589 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2024-10-31 21:57:47,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:57:47,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-10-31 21:57:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:47,594 INFO L225 Difference]: With dead ends: 217 [2024-10-31 21:57:47,595 INFO L226 Difference]: Without dead ends: 111 [2024-10-31 21:57:47,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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-31 21:57:47,596 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:47,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:47,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-31 21:57:47,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-31 21:57:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 21:57:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-10-31 21:57:47,618 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 116 [2024-10-31 21:57:47,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:47,619 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-10-31 21:57:47,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:57:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-10-31 21:57:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-31 21:57:47,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:47,625 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:57:47,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:57:47,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:47,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1822717958, now seen corresponding path program 1 times [2024-10-31 21:57:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:47,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605727188] [2024-10-31 21:57:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:47,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 21:57:47,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:47,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605727188] [2024-10-31 21:57:47,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605727188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:47,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:47,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:47,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056998850] [2024-10-31 21:57:47,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:47,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:57:47,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:47,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:57:47,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:47,957 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:57:47,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:47,993 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-10-31 21:57:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:57:47,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-10-31 21:57:47,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:47,996 INFO L225 Difference]: With dead ends: 222 [2024-10-31 21:57:47,996 INFO L226 Difference]: Without dead ends: 114 [2024-10-31 21:57:47,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-31 21:57:47,997 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:48,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:48,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-31 21:57:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-31 21:57:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 21:57:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-10-31 21:57:48,018 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 118 [2024-10-31 21:57:48,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:48,019 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-10-31 21:57:48,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:57:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-10-31 21:57:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-31 21:57:48,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:48,026 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:57:48,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:57:48,026 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:48,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:48,027 INFO L85 PathProgramCache]: Analyzing trace with hash -47710596, now seen corresponding path program 1 times [2024-10-31 21:57:48,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:48,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853158176] [2024-10-31 21:57:48,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,331 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 21:57:48,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:48,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853158176] [2024-10-31 21:57:48,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853158176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:48,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:48,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:48,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717042105] [2024-10-31 21:57:48,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:48,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:57:48,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:48,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:57:48,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:48,339 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:57:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:48,378 INFO L93 Difference]: Finished difference Result 226 states and 323 transitions. [2024-10-31 21:57:48,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:57:48,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-10-31 21:57:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:48,381 INFO L225 Difference]: With dead ends: 226 [2024-10-31 21:57:48,383 INFO L226 Difference]: Without dead ends: 116 [2024-10-31 21:57:48,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-31 21:57:48,385 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:48,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-31 21:57:48,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-10-31 21:57:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 21:57:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-10-31 21:57:48,407 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 118 [2024-10-31 21:57:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:48,408 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-10-31 21:57:48,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:57:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-10-31 21:57:48,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-31 21:57:48,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:48,410 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:57:48,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:57:48,413 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:48,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:48,414 INFO L85 PathProgramCache]: Analyzing trace with hash -45863554, now seen corresponding path program 1 times [2024-10-31 21:57:48,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:48,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980474174] [2024-10-31 21:57:48,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:48,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 21:57:49,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:49,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980474174] [2024-10-31 21:57:49,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980474174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:49,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:49,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:49,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550604921] [2024-10-31 21:57:49,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:49,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:49,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:49,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:49,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:49,022 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:57:49,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:49,096 INFO L93 Difference]: Finished difference Result 281 states and 398 transitions. [2024-10-31 21:57:49,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:57:49,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-10-31 21:57:49,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:49,098 INFO L225 Difference]: With dead ends: 281 [2024-10-31 21:57:49,098 INFO L226 Difference]: Without dead ends: 169 [2024-10-31 21:57:49,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:49,100 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 62 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:49,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 582 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-31 21:57:49,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 132. [2024-10-31 21:57:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 118 states have (on average 1.3898305084745763) internal successors, (164), 118 states have internal predecessors, (164), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-31 21:57:49,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2024-10-31 21:57:49,113 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 118 [2024-10-31 21:57:49,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:49,113 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2024-10-31 21:57:49,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:57:49,114 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2024-10-31 21:57:49,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-31 21:57:49,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:49,115 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:57:49,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:57:49,116 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:49,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:49,116 INFO L85 PathProgramCache]: Analyzing trace with hash -415824786, now seen corresponding path program 1 times [2024-10-31 21:57:49,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:49,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831652816] [2024-10-31 21:57:49,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:49,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 21:57:49,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:49,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831652816] [2024-10-31 21:57:49,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831652816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:49,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:49,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:57:49,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631913964] [2024-10-31 21:57:49,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:49,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:57:49,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:49,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:57:49,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:49,748 INFO L87 Difference]: Start difference. First operand 132 states and 188 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:57:49,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:49,870 INFO L93 Difference]: Finished difference Result 395 states and 565 transitions. [2024-10-31 21:57:49,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 21:57:49,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-10-31 21:57:49,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:49,875 INFO L225 Difference]: With dead ends: 395 [2024-10-31 21:57:49,876 INFO L226 Difference]: Without dead ends: 266 [2024-10-31 21:57:49,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:57:49,878 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 142 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:49,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1140 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:57:49,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-31 21:57:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2024-10-31 21:57:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 237 states have (on average 1.3881856540084387) internal successors, (329), 237 states have internal predecessors, (329), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 21:57:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 377 transitions. [2024-10-31 21:57:49,911 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 377 transitions. Word has length 119 [2024-10-31 21:57:49,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:49,911 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 377 transitions. [2024-10-31 21:57:49,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:57:49,912 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 377 transitions. [2024-10-31 21:57:49,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-31 21:57:49,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:49,918 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:57:49,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:57:49,918 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:49,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:49,919 INFO L85 PathProgramCache]: Analyzing trace with hash -353785172, now seen corresponding path program 1 times [2024-10-31 21:57:49,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:49,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959126042] [2024-10-31 21:57:49,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:49,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 21:57:50,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:50,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959126042] [2024-10-31 21:57:50,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959126042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:50,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:50,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:57:50,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421473017] [2024-10-31 21:57:50,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:50,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:57:50,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:50,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:57:50,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:50,389 INFO L87 Difference]: Start difference. First operand 264 states and 377 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:57:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:50,579 INFO L93 Difference]: Finished difference Result 599 states and 850 transitions. [2024-10-31 21:57:50,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:57:50,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-10-31 21:57:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:50,582 INFO L225 Difference]: With dead ends: 599 [2024-10-31 21:57:50,582 INFO L226 Difference]: Without dead ends: 338 [2024-10-31 21:57:50,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:57:50,584 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 57 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:50,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 630 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:57:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-31 21:57:50,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 272. [2024-10-31 21:57:50,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 245 states have (on average 1.3755102040816327) internal successors, (337), 245 states have internal predecessors, (337), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 21:57:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 385 transitions. [2024-10-31 21:57:50,609 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 385 transitions. Word has length 119 [2024-10-31 21:57:50,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:50,610 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 385 transitions. [2024-10-31 21:57:50,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:57:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 385 transitions. [2024-10-31 21:57:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-31 21:57:50,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:50,613 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:57:50,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:57:50,613 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:50,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:50,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1098603197, now seen corresponding path program 1 times [2024-10-31 21:57:50,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:50,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554230043] [2024-10-31 21:57:50,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:50,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:50,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 21:57:51,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:51,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554230043] [2024-10-31 21:57:51,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554230043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:51,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:51,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:51,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273194437] [2024-10-31 21:57:51,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:51,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:57:51,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:51,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:57:51,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:51,039 INFO L87 Difference]: Start difference. First operand 272 states and 385 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:57:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:51,135 INFO L93 Difference]: Finished difference Result 541 states and 767 transitions. [2024-10-31 21:57:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:57:51,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-10-31 21:57:51,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:51,137 INFO L225 Difference]: With dead ends: 541 [2024-10-31 21:57:51,137 INFO L226 Difference]: Without dead ends: 272 [2024-10-31 21:57:51,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-31 21:57:51,139 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:51,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 406 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:57:51,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-31 21:57:51,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2024-10-31 21:57:51,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 245 states have (on average 1.3591836734693878) internal successors, (333), 245 states have internal predecessors, (333), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 21:57:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 381 transitions. [2024-10-31 21:57:51,156 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 381 transitions. Word has length 120 [2024-10-31 21:57:51,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:51,156 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 381 transitions. [2024-10-31 21:57:51,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:57:51,157 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 381 transitions. [2024-10-31 21:57:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-31 21:57:51,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:51,159 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:57:51,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 21:57:51,159 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:51,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:51,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1461107900, now seen corresponding path program 1 times [2024-10-31 21:57:51,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:51,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582606123] [2024-10-31 21:57:51,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:51,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 21:57:51,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:51,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582606123] [2024-10-31 21:57:51,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582606123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:51,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:51,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:57:51,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820641194] [2024-10-31 21:57:51,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:51,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:57:51,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:51,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:57:51,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:57:51,462 INFO L87 Difference]: Start difference. First operand 272 states and 381 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:57:51,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:51,525 INFO L93 Difference]: Finished difference Result 541 states and 759 transitions. [2024-10-31 21:57:51,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:57:51,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-10-31 21:57:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:51,528 INFO L225 Difference]: With dead ends: 541 [2024-10-31 21:57:51,528 INFO L226 Difference]: Without dead ends: 272 [2024-10-31 21:57:51,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:57:51,530 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 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.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:51,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:57:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-31 21:57:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2024-10-31 21:57:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 245 states have (on average 1.3428571428571427) internal successors, (329), 245 states have internal predecessors, (329), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 21:57:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 377 transitions. [2024-10-31 21:57:51,547 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 377 transitions. Word has length 122 [2024-10-31 21:57:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:51,548 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 377 transitions. [2024-10-31 21:57:51,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:57:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 377 transitions. [2024-10-31 21:57:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-31 21:57:51,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:51,551 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:57:51,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 21:57:51,551 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:51,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:51,552 INFO L85 PathProgramCache]: Analyzing trace with hash -227835842, now seen corresponding path program 1 times [2024-10-31 21:57:51,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:51,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645068192] [2024-10-31 21:57:51,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:51,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:54,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:54,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:54,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:54,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:54,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:54,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:54,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:54,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:54,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:54,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:54,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:54,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 21:57:54,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:54,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645068192] [2024-10-31 21:57:54,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645068192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:54,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:54,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-31 21:57:54,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988027158] [2024-10-31 21:57:54,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:54,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-31 21:57:54,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:54,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-31 21:57:54,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-31 21:57:54,107 INFO L87 Difference]: Start difference. First operand 272 states and 377 transitions. Second operand has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-31 21:57:56,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:56,095 INFO L93 Difference]: Finished difference Result 983 states and 1367 transitions. [2024-10-31 21:57:56,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-31 21:57:56,096 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 122 [2024-10-31 21:57:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:56,100 INFO L225 Difference]: With dead ends: 983 [2024-10-31 21:57:56,100 INFO L226 Difference]: Without dead ends: 714 [2024-10-31 21:57:56,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2024-10-31 21:57:56,102 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 485 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:56,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1703 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-31 21:57:56,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-10-31 21:57:56,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 310. [2024-10-31 21:57:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 283 states have (on average 1.353356890459364) internal successors, (383), 283 states have internal predecessors, (383), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-31 21:57:56,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 431 transitions. [2024-10-31 21:57:56,163 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 431 transitions. Word has length 122 [2024-10-31 21:57:56,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:56,164 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 431 transitions. [2024-10-31 21:57:56,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-31 21:57:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 431 transitions. [2024-10-31 21:57:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-31 21:57:56,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:56,166 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:57:56,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 21:57:56,166 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:56,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:56,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1248904196, now seen corresponding path program 1 times [2024-10-31 21:57:56,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:56,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468803729] [2024-10-31 21:57:56,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:56,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:56,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:56,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:56,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:56,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:56,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:56,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:56,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:56,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:56,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:56,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:56,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:56,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:56,802 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 21:57:56,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:56,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468803729] [2024-10-31 21:57:56,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468803729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:56,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:56,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:57:56,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548513284] [2024-10-31 21:57:56,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:56,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:57:56,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:56,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:57:56,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:57:56,804 INFO L87 Difference]: Start difference. First operand 310 states and 431 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-31 21:57:57,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:57,183 INFO L93 Difference]: Finished difference Result 744 states and 1025 transitions. [2024-10-31 21:57:57,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:57:57,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2024-10-31 21:57:57,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:57,186 INFO L225 Difference]: With dead ends: 744 [2024-10-31 21:57:57,186 INFO L226 Difference]: Without dead ends: 437 [2024-10-31 21:57:57,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-31 21:57:57,188 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 214 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:57,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 842 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:57:57,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-10-31 21:57:57,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 433. [2024-10-31 21:57:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 400 states have (on average 1.335) internal successors, (534), 402 states have internal predecessors, (534), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-31 21:57:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 590 transitions. [2024-10-31 21:57:57,244 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 590 transitions. Word has length 122 [2024-10-31 21:57:57,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:57,245 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 590 transitions. [2024-10-31 21:57:57,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-31 21:57:57,245 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 590 transitions. [2024-10-31 21:57:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-31 21:57:57,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:57,247 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:57:57,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 21:57:57,247 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:57,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:57,248 INFO L85 PathProgramCache]: Analyzing trace with hash 473764032, now seen corresponding path program 1 times [2024-10-31 21:57:57,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:57,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162959574] [2024-10-31 21:57:57,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:57,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:57,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:57,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:57,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:57,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:57,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:57,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:57,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:57,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:57,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:57,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:57,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:57,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 21:57:57,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:57,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162959574] [2024-10-31 21:57:57,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162959574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:57,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:57,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:57:57,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242599199] [2024-10-31 21:57:57,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:57,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:57:57,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:57,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:57:57,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:57:57,790 INFO L87 Difference]: Start difference. First operand 433 states and 590 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-31 21:57:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:58,183 INFO L93 Difference]: Finished difference Result 945 states and 1280 transitions. [2024-10-31 21:57:58,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:57:58,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2024-10-31 21:57:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:58,188 INFO L225 Difference]: With dead ends: 945 [2024-10-31 21:57:58,189 INFO L226 Difference]: Without dead ends: 515 [2024-10-31 21:57:58,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-31 21:57:58,190 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 234 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:58,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 745 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:57:58,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-31 21:57:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 414. [2024-10-31 21:57:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 381 states have (on average 1.3254593175853018) internal successors, (505), 383 states have internal predecessors, (505), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-31 21:57:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 561 transitions. [2024-10-31 21:57:58,254 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 561 transitions. Word has length 122 [2024-10-31 21:57:58,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:58,255 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 561 transitions. [2024-10-31 21:57:58,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-31 21:57:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 561 transitions. [2024-10-31 21:57:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-31 21:57:58,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:58,257 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:57:58,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 21:57:58,258 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:58,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:58,258 INFO L85 PathProgramCache]: Analyzing trace with hash -547304322, now seen corresponding path program 1 times [2024-10-31 21:57:58,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:58,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201601714] [2024-10-31 21:57:58,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:58,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:57:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:57:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:57:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:57:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:57:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:57:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:57:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:57:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:57:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 21:57:59,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:59,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201601714] [2024-10-31 21:57:59,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201601714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:59,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:59,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-31 21:57:59,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252668503] [2024-10-31 21:57:59,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:59,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 21:57:59,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:59,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 21:57:59,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-31 21:57:59,778 INFO L87 Difference]: Start difference. First operand 414 states and 561 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-31 21:58:00,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:00,579 INFO L93 Difference]: Finished difference Result 725 states and 978 transitions. [2024-10-31 21:58:00,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 21:58:00,580 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 122 [2024-10-31 21:58:00,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:00,583 INFO L225 Difference]: With dead ends: 725 [2024-10-31 21:58:00,583 INFO L226 Difference]: Without dead ends: 519 [2024-10-31 21:58:00,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-10-31 21:58:00,585 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 214 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 21:58:00,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1438 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 21:58:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-10-31 21:58:00,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 418. [2024-10-31 21:58:00,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 385 states have (on average 1.316883116883117) internal successors, (507), 387 states have internal predecessors, (507), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-31 21:58:00,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 563 transitions. [2024-10-31 21:58:00,669 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 563 transitions. Word has length 122 [2024-10-31 21:58:00,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:00,670 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 563 transitions. [2024-10-31 21:58:00,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-31 21:58:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 563 transitions. [2024-10-31 21:58:00,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-31 21:58:00,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:00,673 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:58:00,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 21:58:00,673 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:00,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:00,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1375923712, now seen corresponding path program 1 times [2024-10-31 21:58:00,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:00,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091836507] [2024-10-31 21:58:00,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:00,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:03,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:58:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:03,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:58:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:03,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:58:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:03,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:58:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:03,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:58:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:03,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:58:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:03,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:58:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:03,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:58:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:03,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:58:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:03,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:58:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:03,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:58:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:03,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:58:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 21:58:03,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:03,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091836507] [2024-10-31 21:58:03,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091836507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:03,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:03,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-31 21:58:03,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971987773] [2024-10-31 21:58:03,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:03,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-31 21:58:03,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:03,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-31 21:58:03,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-10-31 21:58:03,403 INFO L87 Difference]: Start difference. First operand 418 states and 563 transitions. Second operand has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-31 21:58:06,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:06,135 INFO L93 Difference]: Finished difference Result 1061 states and 1416 transitions. [2024-10-31 21:58:06,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-31 21:58:06,136 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) Word has length 122 [2024-10-31 21:58:06,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:06,139 INFO L225 Difference]: With dead ends: 1061 [2024-10-31 21:58:06,140 INFO L226 Difference]: Without dead ends: 646 [2024-10-31 21:58:06,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=189, Invalid=933, Unknown=0, NotChecked=0, Total=1122 [2024-10-31 21:58:06,143 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 302 mSDsluCounter, 2002 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-31 21:58:06,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 2220 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-31 21:58:06,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-10-31 21:58:06,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 442. [2024-10-31 21:58:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 409 states have (on average 1.3178484107579462) internal successors, (539), 411 states have internal predecessors, (539), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-31 21:58:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 595 transitions. [2024-10-31 21:58:06,215 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 595 transitions. Word has length 122 [2024-10-31 21:58:06,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:06,215 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 595 transitions. [2024-10-31 21:58:06,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-31 21:58:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 595 transitions. [2024-10-31 21:58:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-31 21:58:06,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:06,218 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:58:06,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 21:58:06,219 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:06,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:06,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1874503042, now seen corresponding path program 1 times [2024-10-31 21:58:06,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:06,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460979082] [2024-10-31 21:58:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:06,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:07,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:58:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:07,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:58:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:07,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:58:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:07,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:58:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:07,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:58:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:07,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:58:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:07,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:58:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:07,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:58:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:07,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:58:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:07,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:58:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:07,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:58:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:07,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:58:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:07,102 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 21:58:07,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:07,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460979082] [2024-10-31 21:58:07,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460979082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:07,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:07,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:58:07,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271123307] [2024-10-31 21:58:07,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:07,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:58:07,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:07,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:58:07,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:58:07,108 INFO L87 Difference]: Start difference. First operand 442 states and 595 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-31 21:58:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:07,648 INFO L93 Difference]: Finished difference Result 1166 states and 1570 transitions. [2024-10-31 21:58:07,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:58:07,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 123 [2024-10-31 21:58:07,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:07,653 INFO L225 Difference]: With dead ends: 1166 [2024-10-31 21:58:07,653 INFO L226 Difference]: Without dead ends: 727 [2024-10-31 21:58:07,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-31 21:58:07,655 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 392 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:58:07,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 710 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:58:07,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-10-31 21:58:07,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 446. [2024-10-31 21:58:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 413 states have (on average 1.305084745762712) internal successors, (539), 415 states have internal predecessors, (539), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-31 21:58:07,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 595 transitions. [2024-10-31 21:58:07,747 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 595 transitions. Word has length 123 [2024-10-31 21:58:07,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:07,748 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 595 transitions. [2024-10-31 21:58:07,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-31 21:58:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 595 transitions. [2024-10-31 21:58:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-31 21:58:07,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:07,750 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:58:07,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 21:58:07,751 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:07,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:07,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2023495788, now seen corresponding path program 1 times [2024-10-31 21:58:07,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:07,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080952491] [2024-10-31 21:58:07,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:07,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:08,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:58:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:08,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 21:58:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:08,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 21:58:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:08,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 21:58:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:08,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:58:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:08,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 21:58:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:08,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:58:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:08,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:58:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:08,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:58:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:08,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:58:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:08,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 21:58:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:08,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 21:58:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-31 21:58:08,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:08,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080952491] [2024-10-31 21:58:08,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080952491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:08,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:08,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:58:08,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015882510] [2024-10-31 21:58:08,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:08,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:58:08,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:08,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:58:08,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:58:08,125 INFO L87 Difference]: Start difference. First operand 446 states and 595 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:58:08,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:08,258 INFO L93 Difference]: Finished difference Result 893 states and 1190 transitions. [2024-10-31 21:58:08,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:58:08,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2024-10-31 21:58:08,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:08,261 INFO L225 Difference]: With dead ends: 893 [2024-10-31 21:58:08,262 INFO L226 Difference]: Without dead ends: 450 [2024-10-31 21:58:08,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:58:08,266 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 61 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 21:58:08,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 698 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 21:58:08,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-10-31 21:58:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 446. [2024-10-31 21:58:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 413 states have (on average 1.2857142857142858) internal successors, (531), 415 states have internal predecessors, (531), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-31 21:58:08,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 587 transitions. [2024-10-31 21:58:08,331 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 587 transitions. Word has length 123 [2024-10-31 21:58:08,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:08,332 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 587 transitions. [2024-10-31 21:58:08,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-31 21:58:08,332 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 587 transitions. [2024-10-31 21:58:08,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-31 21:58:08,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:08,334 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 21:58:08,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 21:58:08,335 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:08,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:08,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2086397604, now seen corresponding path program 1 times [2024-10-31 21:58:08,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:08,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214328542] [2024-10-31 21:58:08,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:08,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat