./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/bin/uautomizer-verify-uTZkv6EMXl --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 21018b8dbfba8116b3b0bab68e9887f4757cf1a4556541f23f42e4d95555f99e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:19:05,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:19:05,127 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:19:05,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:19:05,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:19:05,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:19:05,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:19:05,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:19:05,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:19:05,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:19:05,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:19:05,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:19:05,175 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:19:05,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:19:05,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:19:05,177 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:19:05,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:19:05,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:19:05,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:19:05,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:19:05,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:19:05,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:19:05,182 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:19:05,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:19:05,184 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:19:05,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:19:05,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:19:05,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:19:05,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:19:05,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:19:05,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:19:05,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:19:05,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:19:05,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:19:05,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:19:05,190 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:19:05,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:19:05,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:19:05,192 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:19:05,192 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_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/bin/uautomizer-verify-uTZkv6EMXl/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_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/bin/uautomizer-verify-uTZkv6EMXl 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 -> 21018b8dbfba8116b3b0bab68e9887f4757cf1a4556541f23f42e4d95555f99e [2023-11-12 02:19:05,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:19:05,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:19:05,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:19:05,585 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:19:05,586 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:19:05,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i [2023-11-12 02:19:09,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:19:09,606 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:19:09,606 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i [2023-11-12 02:19:09,618 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/bin/uautomizer-verify-uTZkv6EMXl/data/3e48d203a/ed000404db944a6c9599e867e3b8df8e/FLAG48b67e5cd [2023-11-12 02:19:09,634 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/bin/uautomizer-verify-uTZkv6EMXl/data/3e48d203a/ed000404db944a6c9599e867e3b8df8e [2023-11-12 02:19:09,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:19:09,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:19:09,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:19:09,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:19:09,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:19:09,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:19:09" (1/1) ... [2023-11-12 02:19:09,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77820d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:09, skipping insertion in model container [2023-11-12 02:19:09,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:19:09" (1/1) ... [2023-11-12 02:19:09,690 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:19:09,915 WARN L240 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_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i[917,930] [2023-11-12 02:19:09,989 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:19:10,004 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:19:10,023 WARN L240 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_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i[917,930] [2023-11-12 02:19:10,066 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:19:10,098 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:19:10,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:10 WrapperNode [2023-11-12 02:19:10,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:19:10,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:19:10,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:19:10,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:19:10,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:10" (1/1) ... [2023-11-12 02:19:10,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:10" (1/1) ... [2023-11-12 02:19:10,181 INFO L138 Inliner]: procedures = 29, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 473 [2023-11-12 02:19:10,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:19:10,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:19:10,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:19:10,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:19:10,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:10" (1/1) ... [2023-11-12 02:19:10,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:10" (1/1) ... [2023-11-12 02:19:10,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:10" (1/1) ... [2023-11-12 02:19:10,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:10" (1/1) ... [2023-11-12 02:19:10,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:10" (1/1) ... [2023-11-12 02:19:10,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:10" (1/1) ... [2023-11-12 02:19:10,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:10" (1/1) ... [2023-11-12 02:19:10,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:10" (1/1) ... [2023-11-12 02:19:10,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:19:10,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:19:10,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:19:10,260 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:19:10,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:10" (1/1) ... [2023-11-12 02:19:10,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:19:10,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:19:10,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:19:10,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65ff901d-0ec0-41b3-86b6-a4aba2ce4689/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:19:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:19:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-12 02:19:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:19:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-12 02:19:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:19:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-12 02:19:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:19:10,360 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:19:10,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:19:10,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:19:10,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:19:10,527 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:19:10,529 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:19:11,166 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:19:11,174 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:19:11,185 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:19:11,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:19:11 BoogieIcfgContainer [2023-11-12 02:19:11,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:19:11,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:19:11,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:19:11,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:19:11,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:19:09" (1/3) ... [2023-11-12 02:19:11,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622b7ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:19:11, skipping insertion in model container [2023-11-12 02:19:11,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:10" (2/3) ... [2023-11-12 02:19:11,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622b7ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:19:11, skipping insertion in model container [2023-11-12 02:19:11,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:19:11" (3/3) ... [2023-11-12 02:19:11,214 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-70.i [2023-11-12 02:19:11,234 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:19:11,234 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:19:11,300 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:19:11,306 INFO L357 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, mHoare=true, 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;@666cdb19, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:19:11,306 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:19:11,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 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) [2023-11-12 02:19:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:19:11,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:11,328 INFO L195 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] [2023-11-12 02:19:11,329 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:19:11,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:11,335 INFO L85 PathProgramCache]: Analyzing trace with hash 106270662, now seen corresponding path program 1 times [2023-11-12 02:19:11,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:11,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204232845] [2023-11-12 02:19:11,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:11,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:11,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:11,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:11,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-12 02:19:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:11,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:19:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:11,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:19:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:11,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:19:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:11,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:19:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:11,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:19:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:11,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:19:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:11,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:19:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:11,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:11,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:19:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:11,842 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:19:11,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:11,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204232845] [2023-11-12 02:19:11,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204232845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:11,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:11,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:19:11,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887570182] [2023-11-12 02:19:11,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:11,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:19:11,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:11,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:19:11,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:19:11,903 INFO L87 Difference]: Start difference. First operand has 107 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 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) [2023-11-12 02:19:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:11,944 INFO L93 Difference]: Finished difference Result 207 states and 322 transitions. [2023-11-12 02:19:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:19:11,947 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 [2023-11-12 02:19:11,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:11,957 INFO L225 Difference]: With dead ends: 207 [2023-11-12 02:19:11,958 INFO L226 Difference]: Without dead ends: 103 [2023-11-12 02:19:11,962 INFO L412 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 [2023-11-12 02:19:11,966 INFO L413 NwaCegarLoop]: 151 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, 151 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 [2023-11-12 02:19:11,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:11,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-12 02:19:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-12 02:19:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 89 states have internal predecessors, (127), 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) [2023-11-12 02:19:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2023-11-12 02:19:12,022 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 116 [2023-11-12 02:19:12,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:12,022 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2023-11-12 02:19:12,023 INFO L496 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) [2023-11-12 02:19:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2023-11-12 02:19:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:19:12,027 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:12,028 INFO L195 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] [2023-11-12 02:19:12,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:19:12,028 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:19:12,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:12,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2089856086, now seen corresponding path program 1 times [2023-11-12 02:19:12,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:12,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596545182] [2023-11-12 02:19:12,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:12,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:12,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:12,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:12,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-12 02:19:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:12,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:19:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:12,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:19:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:12,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:19:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:12,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:19:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:12,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:19:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:12,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:19:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:12,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:19:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:12,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:12,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:19:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:19:12,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:12,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596545182] [2023-11-12 02:19:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596545182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:12,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:12,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:19:12,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177982181] [2023-11-12 02:19:12,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:12,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:19:12,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:12,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:19:12,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:19:12,730 INFO L87 Difference]: Start difference. First operand 103 states and 151 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) [2023-11-12 02:19:12,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:12,846 INFO L93 Difference]: Finished difference Result 227 states and 336 transitions. [2023-11-12 02:19:12,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:19:12,847 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 [2023-11-12 02:19:12,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:12,849 INFO L225 Difference]: With dead ends: 227 [2023-11-12 02:19:12,850 INFO L226 Difference]: Without dead ends: 127 [2023-11-12 02:19:12,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:12,853 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 44 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:12,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 489 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-12 02:19:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2023-11-12 02:19:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 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) [2023-11-12 02:19:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2023-11-12 02:19:12,869 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 116 [2023-11-12 02:19:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:12,871 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2023-11-12 02:19:12,871 INFO L496 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) [2023-11-12 02:19:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2023-11-12 02:19:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:19:12,874 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:12,874 INFO L195 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] [2023-11-12 02:19:12,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:19:12,875 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:19:12,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:12,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1126398447, now seen corresponding path program 1 times [2023-11-12 02:19:12,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:12,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677674955] [2023-11-12 02:19:12,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:12,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:13,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:13,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:13,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-12 02:19:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:13,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:19:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:13,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:19:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:13,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:19:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:13,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:19:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:13,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:19:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:13,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:19:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:13,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:19:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:13,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:13,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:19:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:19:13,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:13,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677674955] [2023-11-12 02:19:13,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677674955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:13,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:13,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:19:13,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570705060] [2023-11-12 02:19:13,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:13,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:19:13,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:13,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:19:13,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:19:13,183 INFO L87 Difference]: Start difference. First operand 105 states and 153 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) [2023-11-12 02:19:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:13,248 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2023-11-12 02:19:13,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:19:13,249 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 [2023-11-12 02:19:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:13,258 INFO L225 Difference]: With dead ends: 215 [2023-11-12 02:19:13,258 INFO L226 Difference]: Without dead ends: 113 [2023-11-12 02:19:13,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:13,267 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 12 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:13,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 437 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-12 02:19:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2023-11-12 02:19:13,289 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) [2023-11-12 02:19:13,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2023-11-12 02:19:13,297 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 118 [2023-11-12 02:19:13,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:13,300 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2023-11-12 02:19:13,300 INFO L496 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) [2023-11-12 02:19:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2023-11-12 02:19:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:19:13,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:13,307 INFO L195 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] [2023-11-12 02:19:13,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:19:13,308 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:19:13,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash 648608915, now seen corresponding path program 1 times [2023-11-12 02:19:13,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:13,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544898647] [2023-11-12 02:19:13,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:13,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:14,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:14,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:14,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-12 02:19:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:14,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:19:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:14,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:19:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:14,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:19:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:14,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:19:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:14,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:19:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:14,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:19:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:14,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:19:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:14,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:14,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:19:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:19:14,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:14,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544898647] [2023-11-12 02:19:14,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544898647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:14,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:14,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:19:14,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836988893] [2023-11-12 02:19:14,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:14,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:19:14,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:14,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:19:14,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:14,081 INFO L87 Difference]: Start difference. First operand 107 states and 155 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) [2023-11-12 02:19:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:14,357 INFO L93 Difference]: Finished difference Result 225 states and 329 transitions. [2023-11-12 02:19:14,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:19:14,359 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 [2023-11-12 02:19:14,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:14,369 INFO L225 Difference]: With dead ends: 225 [2023-11-12 02:19:14,369 INFO L226 Difference]: Without dead ends: 121 [2023-11-12 02:19:14,372 INFO L412 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 [2023-11-12 02:19:14,378 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 18 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:14,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 470 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:19:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-12 02:19:14,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 110. [2023-11-12 02:19:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 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) [2023-11-12 02:19:14,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2023-11-12 02:19:14,410 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 118 [2023-11-12 02:19:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:14,413 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2023-11-12 02:19:14,413 INFO L496 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) [2023-11-12 02:19:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2023-11-12 02:19:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:19:14,420 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:14,421 INFO L195 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] [2023-11-12 02:19:14,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:19:14,422 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:19:14,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:14,422 INFO L85 PathProgramCache]: Analyzing trace with hash 851197139, now seen corresponding path program 1 times [2023-11-12 02:19:14,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:14,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497338971] [2023-11-12 02:19:14,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:14,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-12 02:19:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:19:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:19:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:19:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:19:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:19:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:19:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:19:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:19:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:19:15,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:15,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497338971] [2023-11-12 02:19:15,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497338971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:15,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:15,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:19:15,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154506142] [2023-11-12 02:19:15,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:15,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:19:15,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:15,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:19:15,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:19:15,491 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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) [2023-11-12 02:19:16,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:16,152 INFO L93 Difference]: Finished difference Result 287 states and 414 transitions. [2023-11-12 02:19:16,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:19:16,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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 [2023-11-12 02:19:16,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:16,156 INFO L225 Difference]: With dead ends: 287 [2023-11-12 02:19:16,156 INFO L226 Difference]: Without dead ends: 180 [2023-11-12 02:19:16,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:19:16,161 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 351 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:16,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 500 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:19:16,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-12 02:19:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 123. [2023-11-12 02:19:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 109 states have internal predecessors, (153), 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) [2023-11-12 02:19:16,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 177 transitions. [2023-11-12 02:19:16,194 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 177 transitions. Word has length 118 [2023-11-12 02:19:16,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:16,196 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 177 transitions. [2023-11-12 02:19:16,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 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) [2023-11-12 02:19:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 177 transitions. [2023-11-12 02:19:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-12 02:19:16,200 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:16,201 INFO L195 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] [2023-11-12 02:19:16,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:19:16,201 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:19:16,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1881418347, now seen corresponding path program 1 times [2023-11-12 02:19:16,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:16,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568454554] [2023-11-12 02:19:16,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:16,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-12 02:19:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:19:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:19:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:19:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:19:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:19:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:19:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:19:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:19:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,773 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:19:16,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:16,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568454554] [2023-11-12 02:19:16,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568454554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:16,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:16,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:19:16,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632136984] [2023-11-12 02:19:16,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:16,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:19:16,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:16,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:19:16,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:16,785 INFO L87 Difference]: Start difference. First operand 123 states and 177 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) [2023-11-12 02:19:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:17,104 INFO L93 Difference]: Finished difference Result 297 states and 428 transitions. [2023-11-12 02:19:17,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:19:17,108 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 [2023-11-12 02:19:17,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:17,110 INFO L225 Difference]: With dead ends: 297 [2023-11-12 02:19:17,110 INFO L226 Difference]: Without dead ends: 177 [2023-11-12 02:19:17,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:19:17,111 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 175 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:17,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 455 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:19:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-12 02:19:17,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 125. [2023-11-12 02:19:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 111 states have (on average 1.3963963963963963) internal successors, (155), 111 states have internal predecessors, (155), 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) [2023-11-12 02:19:17,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 179 transitions. [2023-11-12 02:19:17,149 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 179 transitions. Word has length 119 [2023-11-12 02:19:17,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:17,150 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 179 transitions. [2023-11-12 02:19:17,151 INFO L496 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) [2023-11-12 02:19:17,151 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 179 transitions. [2023-11-12 02:19:17,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-12 02:19:17,153 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:17,153 INFO L195 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] [2023-11-12 02:19:17,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:19:17,154 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:19:17,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:17,155 INFO L85 PathProgramCache]: Analyzing trace with hash -409562581, now seen corresponding path program 1 times [2023-11-12 02:19:17,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:17,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712522583] [2023-11-12 02:19:17,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:17,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-12 02:19:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:19:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:19:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:19:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:19:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:19:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:19:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:19:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:19:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:19:17,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:17,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712522583] [2023-11-12 02:19:17,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712522583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:17,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:17,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:19:17,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984775361] [2023-11-12 02:19:17,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:17,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:19:17,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:17,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:19:17,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:17,600 INFO L87 Difference]: Start difference. First operand 125 states and 179 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) [2023-11-12 02:19:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:17,679 INFO L93 Difference]: Finished difference Result 269 states and 387 transitions. [2023-11-12 02:19:17,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:19:17,680 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 [2023-11-12 02:19:17,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:17,682 INFO L225 Difference]: With dead ends: 269 [2023-11-12 02:19:17,682 INFO L226 Difference]: Without dead ends: 147 [2023-11-12 02:19:17,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:19:17,687 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 84 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:17,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 586 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-12 02:19:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 128. [2023-11-12 02:19:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 114 states have internal predecessors, (158), 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) [2023-11-12 02:19:17,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 182 transitions. [2023-11-12 02:19:17,705 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 182 transitions. Word has length 119 [2023-11-12 02:19:17,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:17,706 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 182 transitions. [2023-11-12 02:19:17,706 INFO L496 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) [2023-11-12 02:19:17,707 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 182 transitions. [2023-11-12 02:19:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-12 02:19:17,708 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:17,709 INFO L195 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] [2023-11-12 02:19:17,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:19:17,709 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:19:17,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:17,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2011536986, now seen corresponding path program 1 times [2023-11-12 02:19:17,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:17,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953541239] [2023-11-12 02:19:17,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:17,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-12 02:19:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:19:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:19:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:19:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:19:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:19:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:19:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:19:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:19:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:19:18,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:18,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953541239] [2023-11-12 02:19:18,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953541239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:18,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:18,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:19:18,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923588285] [2023-11-12 02:19:18,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:18,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:19:18,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:18,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:19:18,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:19:18,446 INFO L87 Difference]: Start difference. First operand 128 states and 182 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) [2023-11-12 02:19:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:18,647 INFO L93 Difference]: Finished difference Result 253 states and 361 transitions. [2023-11-12 02:19:18,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:19:18,648 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 [2023-11-12 02:19:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:18,650 INFO L225 Difference]: With dead ends: 253 [2023-11-12 02:19:18,650 INFO L226 Difference]: Without dead ends: 128 [2023-11-12 02:19:18,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:18,655 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 10 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:18,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 341 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:19:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-12 02:19:18,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-11-12 02:19:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 114 states have (on average 1.368421052631579) internal successors, (156), 114 states have internal predecessors, (156), 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) [2023-11-12 02:19:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 180 transitions. [2023-11-12 02:19:18,674 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 180 transitions. Word has length 120 [2023-11-12 02:19:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:18,675 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 180 transitions. [2023-11-12 02:19:18,675 INFO L496 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) [2023-11-12 02:19:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 180 transitions. [2023-11-12 02:19:18,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-12 02:19:18,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:18,679 INFO L195 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] [2023-11-12 02:19:18,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:19:18,680 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:19:18,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:18,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1924709268, now seen corresponding path program 1 times [2023-11-12 02:19:18,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:18,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992447530] [2023-11-12 02:19:18,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:18,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:19,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:19,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:19,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-12 02:19:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:19,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:19:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:19,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:19:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:19,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:19:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:19,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:19:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:19,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:19:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:19,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:19:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:19,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:19:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:19,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:19,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:19:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:19:19,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:19,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992447530] [2023-11-12 02:19:19,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992447530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:19,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:19,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:19:19,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120812831] [2023-11-12 02:19:19,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:19,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:19:19,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:19,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:19:19,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:19:19,133 INFO L87 Difference]: Start difference. First operand 128 states and 180 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) [2023-11-12 02:19:19,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:19,154 INFO L93 Difference]: Finished difference Result 253 states and 357 transitions. [2023-11-12 02:19:19,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:19:19,155 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 [2023-11-12 02:19:19,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:19,156 INFO L225 Difference]: With dead ends: 253 [2023-11-12 02:19:19,157 INFO L226 Difference]: Without dead ends: 128 [2023-11-12 02:19:19,157 INFO L412 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 [2023-11-12 02:19:19,160 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:19,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-12 02:19:19,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-11-12 02:19:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 states have internal predecessors, (154), 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) [2023-11-12 02:19:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 178 transitions. [2023-11-12 02:19:19,172 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 178 transitions. Word has length 122 [2023-11-12 02:19:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:19,173 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 178 transitions. [2023-11-12 02:19:19,173 INFO L496 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) [2023-11-12 02:19:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 178 transitions. [2023-11-12 02:19:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-12 02:19:19,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:19,176 INFO L195 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] [2023-11-12 02:19:19,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:19:19,176 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:19:19,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:19,177 INFO L85 PathProgramCache]: Analyzing trace with hash 235765526, now seen corresponding path program 1 times [2023-11-12 02:19:19,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:19,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319653464] [2023-11-12 02:19:19,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:19,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-12 02:19:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:19:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:19:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:19:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:19:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:19:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:19:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:19:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:19:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:19:20,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:20,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319653464] [2023-11-12 02:19:20,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319653464] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:20,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:20,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-12 02:19:20,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831966634] [2023-11-12 02:19:20,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:20,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:19:20,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:20,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:19:20,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:19:20,849 INFO L87 Difference]: Start difference. First operand 128 states and 178 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 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) [2023-11-12 02:19:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:21,677 INFO L93 Difference]: Finished difference Result 366 states and 509 transitions. [2023-11-12 02:19:21,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:19:21,678 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 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 [2023-11-12 02:19:21,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:21,680 INFO L225 Difference]: With dead ends: 366 [2023-11-12 02:19:21,680 INFO L226 Difference]: Without dead ends: 241 [2023-11-12 02:19:21,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:19:21,682 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 394 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:21,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 779 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 02:19:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-11-12 02:19:21,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 146. [2023-11-12 02:19:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 132 states have (on average 1.356060606060606) internal successors, (179), 132 states have internal predecessors, (179), 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) [2023-11-12 02:19:21,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 203 transitions. [2023-11-12 02:19:21,696 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 203 transitions. Word has length 122 [2023-11-12 02:19:21,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:21,696 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 203 transitions. [2023-11-12 02:19:21,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 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) [2023-11-12 02:19:21,697 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 203 transitions. [2023-11-12 02:19:21,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-12 02:19:21,698 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:21,698 INFO L195 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] [2023-11-12 02:19:21,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:19:21,699 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:19:21,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:21,699 INFO L85 PathProgramCache]: Analyzing trace with hash -785302828, now seen corresponding path program 1 times [2023-11-12 02:19:21,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:21,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613263184] [2023-11-12 02:19:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:21,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:23,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:23,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:23,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-12 02:19:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:23,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:19:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:23,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:19:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:23,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:19:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:23,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:19:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:23,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:19:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:23,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:19:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:23,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:19:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:23,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:23,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:19:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:23,781 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:19:23,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:23,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613263184] [2023-11-12 02:19:23,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613263184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:23,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:23,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:19:23,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024838445] [2023-11-12 02:19:23,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:23,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:19:23,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:23,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:19:23,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:19:23,784 INFO L87 Difference]: Start difference. First operand 146 states and 203 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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) [2023-11-12 02:19:24,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:24,528 INFO L93 Difference]: Finished difference Result 289 states and 403 transitions. [2023-11-12 02:19:24,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:19:24,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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 [2023-11-12 02:19:24,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:24,534 INFO L225 Difference]: With dead ends: 289 [2023-11-12 02:19:24,534 INFO L226 Difference]: Without dead ends: 146 [2023-11-12 02:19:24,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:19:24,535 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 123 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:24,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 466 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:19:24,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-12 02:19:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2023-11-12 02:19:24,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 131 states have (on average 1.3511450381679388) internal successors, (177), 131 states have internal predecessors, (177), 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) [2023-11-12 02:19:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 201 transitions. [2023-11-12 02:19:24,557 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 201 transitions. Word has length 122 [2023-11-12 02:19:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:24,557 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 201 transitions. [2023-11-12 02:19:24,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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) [2023-11-12 02:19:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 201 transitions. [2023-11-12 02:19:24,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-12 02:19:24,560 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:24,560 INFO L195 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] [2023-11-12 02:19:24,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:19:24,560 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:19:24,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:24,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1137925206, now seen corresponding path program 1 times [2023-11-12 02:19:24,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:24,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999827052] [2023-11-12 02:19:24,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:24,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:33,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:33,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:33,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-12 02:19:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:33,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:19:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:33,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:19:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:33,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:19:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:33,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:19:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:33,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:19:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:33,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:19:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:33,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:19:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:33,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:33,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:19:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-12 02:19:33,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:33,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999827052] [2023-11-12 02:19:33,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999827052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:33,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:33,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-12 02:19:33,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518306296] [2023-11-12 02:19:33,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:33,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-12 02:19:33,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:33,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-12 02:19:33,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2023-11-12 02:19:33,867 INFO L87 Difference]: Start difference. First operand 145 states and 201 transitions. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 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) [2023-11-12 02:19:38,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-12 02:19:46,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []