./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu --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 c9ea8f5132fafef47c5cde74633ce85a3773c3d65cff180ef26fe244a046ff77 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:56:59,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:56:59,355 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:56:59,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:56:59,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:56:59,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:56:59,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:56:59,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:56:59,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:56:59,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:56:59,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:56:59,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:56:59,446 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:56:59,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:56:59,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:56:59,447 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:56:59,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:56:59,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:56:59,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:56:59,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:56:59,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:56:59,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:56:59,453 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:56:59,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:56:59,456 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:56:59,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:56:59,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:56:59,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:56:59,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:56:59,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:56:59,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:56:59,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:56:59,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:56:59,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:56:59,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:56:59,463 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:56:59,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:56:59,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:56:59,464 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:56:59,464 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_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/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_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu 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 -> c9ea8f5132fafef47c5cde74633ce85a3773c3d65cff180ef26fe244a046ff77 [2023-11-19 07:56:59,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:56:59,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:56:59,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:56:59,881 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:56:59,881 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:56:59,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i [2023-11-19 07:57:02,963 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:57:03,244 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:57:03,245 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i [2023-11-19 07:57:03,254 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/data/09cddbd44/ba8194cae0df4b06be46a8c35962e23e/FLAG54aca4741 [2023-11-19 07:57:03,269 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/data/09cddbd44/ba8194cae0df4b06be46a8c35962e23e [2023-11-19 07:57:03,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:57:03,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:57:03,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:57:03,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:57:03,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:57:03,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:57:03" (1/1) ... [2023-11-19 07:57:03,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@554253cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:03, skipping insertion in model container [2023-11-19 07:57:03,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:57:03" (1/1) ... [2023-11-19 07:57:03,328 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:57:03,522 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_fbed4662-4e06-4f46-ae15-8963117b3af9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i[917,930] [2023-11-19 07:57:03,611 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:57:03,634 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:57:03,652 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_fbed4662-4e06-4f46-ae15-8963117b3af9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i[917,930] [2023-11-19 07:57:03,700 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:57:03,728 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:57:03,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:03 WrapperNode [2023-11-19 07:57:03,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:57:03,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:57:03,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:57:03,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:57:03,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:03" (1/1) ... [2023-11-19 07:57:03,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:03" (1/1) ... [2023-11-19 07:57:03,813 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 297 [2023-11-19 07:57:03,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:57:03,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:57:03,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:57:03,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:57:03,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:03" (1/1) ... [2023-11-19 07:57:03,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:03" (1/1) ... [2023-11-19 07:57:03,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:03" (1/1) ... [2023-11-19 07:57:03,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:03" (1/1) ... [2023-11-19 07:57:03,865 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:03" (1/1) ... [2023-11-19 07:57:03,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:03" (1/1) ... [2023-11-19 07:57:03,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:03" (1/1) ... [2023-11-19 07:57:03,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:03" (1/1) ... [2023-11-19 07:57:03,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:57:03,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:57:03,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:57:03,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:57:03,904 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:03" (1/1) ... [2023-11-19 07:57:03,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:57:03,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:57:03,932 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:57:03,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:57:03,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:57:03,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:57:03,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:57:03,987 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:57:03,987 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:57:03,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:57:03,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:57:03,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:57:04,099 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:57:04,101 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:57:04,521 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:57:04,538 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:57:04,539 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:57:04,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:57:04 BoogieIcfgContainer [2023-11-19 07:57:04,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:57:04,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:57:04,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:57:04,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:57:04,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:57:03" (1/3) ... [2023-11-19 07:57:04,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392b43db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:57:04, skipping insertion in model container [2023-11-19 07:57:04,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:57:03" (2/3) ... [2023-11-19 07:57:04,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392b43db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:57:04, skipping insertion in model container [2023-11-19 07:57:04,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:57:04" (3/3) ... [2023-11-19 07:57:04,553 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-62.i [2023-11-19 07:57:04,573 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:57:04,574 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:57:04,626 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:57:04,633 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;@1fbb5588, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:57:04,634 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:57:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:57:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-19 07:57:04,650 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:04,651 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:57:04,652 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:04,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:04,657 INFO L85 PathProgramCache]: Analyzing trace with hash -256564704, now seen corresponding path program 1 times [2023-11-19 07:57:04,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:04,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039323485] [2023-11-19 07:57:04,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:04,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:04,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:57:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:04,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:57:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:04,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:57:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:04,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:57:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:05,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:57:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:05,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:57:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:05,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:57:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:57:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:57:05,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:05,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039323485] [2023-11-19 07:57:05,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039323485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:05,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:05,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:57:05,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40914633] [2023-11-19 07:57:05,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:05,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:57:05,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:05,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:57:05,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:57:05,110 INFO L87 Difference]: Start difference. First operand has 73 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 07:57:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:05,157 INFO L93 Difference]: Finished difference Result 139 states and 210 transitions. [2023-11-19 07:57:05,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:57:05,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2023-11-19 07:57:05,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:05,171 INFO L225 Difference]: With dead ends: 139 [2023-11-19 07:57:05,171 INFO L226 Difference]: Without dead ends: 69 [2023-11-19 07:57:05,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-19 07:57:05,183 INFO L413 NwaCegarLoop]: 97 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, 97 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-19 07:57:05,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:57:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-19 07:57:05,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-11-19 07:57:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:57:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2023-11-19 07:57:05,281 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 73 [2023-11-19 07:57:05,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:05,282 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2023-11-19 07:57:05,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 07:57:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2023-11-19 07:57:05,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-19 07:57:05,292 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:05,295 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:57:05,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:57:05,296 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:05,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:05,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1770871312, now seen corresponding path program 1 times [2023-11-19 07:57:05,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:05,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770689241] [2023-11-19 07:57:05,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:05,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:05,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:57:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:05,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:57:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:05,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:57:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:05,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:57:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:05,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:57:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:05,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:57:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:05,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:57:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:05,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:57:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:57:05,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:05,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770689241] [2023-11-19 07:57:05,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770689241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:05,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:05,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:57:05,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807900255] [2023-11-19 07:57:05,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:05,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:57:05,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:05,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:57:05,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:57:05,721 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:57:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:05,821 INFO L93 Difference]: Finished difference Result 143 states and 202 transitions. [2023-11-19 07:57:05,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:57:05,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2023-11-19 07:57:05,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:05,832 INFO L225 Difference]: With dead ends: 143 [2023-11-19 07:57:05,832 INFO L226 Difference]: Without dead ends: 77 [2023-11-19 07:57:05,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-19 07:57:05,840 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 12 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 275 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-19 07:57:05,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 275 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:57:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-19 07:57:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2023-11-19 07:57:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:57:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2023-11-19 07:57:05,858 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 73 [2023-11-19 07:57:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:05,863 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2023-11-19 07:57:05,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:57:05,864 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2023-11-19 07:57:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-19 07:57:05,867 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:05,867 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:57:05,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:57:05,868 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:05,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:05,868 INFO L85 PathProgramCache]: Analyzing trace with hash -749088622, now seen corresponding path program 1 times [2023-11-19 07:57:05,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:05,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702681696] [2023-11-19 07:57:05,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:05,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:06,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:57:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:06,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:57:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:06,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:57:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:06,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:57:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:06,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:57:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:06,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:57:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:06,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:57:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:06,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:57:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:57:06,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:06,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702681696] [2023-11-19 07:57:06,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702681696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:06,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:06,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:57:06,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264800057] [2023-11-19 07:57:06,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:06,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:57:06,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:06,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:57:06,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:57:06,129 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:57:06,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:06,179 INFO L93 Difference]: Finished difference Result 143 states and 200 transitions. [2023-11-19 07:57:06,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:57:06,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2023-11-19 07:57:06,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:06,185 INFO L225 Difference]: With dead ends: 143 [2023-11-19 07:57:06,185 INFO L226 Difference]: Without dead ends: 75 [2023-11-19 07:57:06,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-19 07:57:06,192 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 3 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:57:06,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 275 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:57:06,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-19 07:57:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2023-11-19 07:57:06,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:57:06,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2023-11-19 07:57:06,208 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 73 [2023-11-19 07:57:06,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:06,210 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2023-11-19 07:57:06,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:57:06,210 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2023-11-19 07:57:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-19 07:57:06,216 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:06,217 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:57:06,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:57:06,217 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:06,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:06,218 INFO L85 PathProgramCache]: Analyzing trace with hash -747241580, now seen corresponding path program 1 times [2023-11-19 07:57:06,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:06,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176184820] [2023-11-19 07:57:06,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:06,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:06,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:57:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:06,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:57:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:07,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:57:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:07,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:57:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:07,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:57:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:07,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:57:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:07,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:57:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:07,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:57:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:57:07,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:07,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176184820] [2023-11-19 07:57:07,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176184820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:07,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:07,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:57:07,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646541974] [2023-11-19 07:57:07,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:07,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:57:07,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:07,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:57:07,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:57:07,089 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:57:07,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:07,343 INFO L93 Difference]: Finished difference Result 181 states and 250 transitions. [2023-11-19 07:57:07,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:57:07,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2023-11-19 07:57:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:07,346 INFO L225 Difference]: With dead ends: 181 [2023-11-19 07:57:07,346 INFO L226 Difference]: Without dead ends: 111 [2023-11-19 07:57:07,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:57:07,349 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 178 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:57:07,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 158 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:57:07,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-19 07:57:07,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 75. [2023-11-19 07:57:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:57:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2023-11-19 07:57:07,364 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 73 [2023-11-19 07:57:07,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:07,365 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2023-11-19 07:57:07,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:57:07,366 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2023-11-19 07:57:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-19 07:57:07,367 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:07,368 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:57:07,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:57:07,368 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:07,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:07,369 INFO L85 PathProgramCache]: Analyzing trace with hash -991247921, now seen corresponding path program 1 times [2023-11-19 07:57:07,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:07,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514054843] [2023-11-19 07:57:07,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:07,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:07,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:57:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:07,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:57:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:07,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:57:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:07,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:57:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:07,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:57:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:07,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:57:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:07,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:57:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:07,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:57:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:57:07,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:07,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514054843] [2023-11-19 07:57:07,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514054843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:07,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:07,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:57:07,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874097527] [2023-11-19 07:57:07,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:07,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:57:07,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:07,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:57:07,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:57:07,791 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 07:57:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:08,245 INFO L93 Difference]: Finished difference Result 215 states and 296 transitions. [2023-11-19 07:57:08,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:57:08,246 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2023-11-19 07:57:08,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:08,248 INFO L225 Difference]: With dead ends: 215 [2023-11-19 07:57:08,249 INFO L226 Difference]: Without dead ends: 143 [2023-11-19 07:57:08,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:57:08,251 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 450 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:57:08,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 364 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:57:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-19 07:57:08,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 85. [2023-11-19 07:57:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:57:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2023-11-19 07:57:08,279 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 75 [2023-11-19 07:57:08,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:08,281 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2023-11-19 07:57:08,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 07:57:08,281 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2023-11-19 07:57:08,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-19 07:57:08,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:08,284 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:57:08,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:57:08,285 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:08,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:08,285 INFO L85 PathProgramCache]: Analyzing trace with hash -387496087, now seen corresponding path program 1 times [2023-11-19 07:57:08,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:08,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166279303] [2023-11-19 07:57:08,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:08,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:08,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:57:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:08,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:57:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:08,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:57:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:08,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:57:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:08,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:57:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:08,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:57:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:08,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:57:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:08,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:57:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:57:08,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:08,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166279303] [2023-11-19 07:57:08,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166279303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:08,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:08,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:57:08,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913986773] [2023-11-19 07:57:08,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:08,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:57:08,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:08,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:57:08,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:57:08,971 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:57:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:09,162 INFO L93 Difference]: Finished difference Result 169 states and 233 transitions. [2023-11-19 07:57:09,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:57:09,163 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2023-11-19 07:57:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:09,164 INFO L225 Difference]: With dead ends: 169 [2023-11-19 07:57:09,164 INFO L226 Difference]: Without dead ends: 87 [2023-11-19 07:57:09,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:57:09,166 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 182 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:57:09,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 137 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:57:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-19 07:57:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2023-11-19 07:57:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:57:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 114 transitions. [2023-11-19 07:57:09,177 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 114 transitions. Word has length 75 [2023-11-19 07:57:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:09,178 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 114 transitions. [2023-11-19 07:57:09,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:57:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 114 transitions. [2023-11-19 07:57:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-19 07:57:09,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:09,180 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:57:09,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:57:09,180 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:09,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:09,181 INFO L85 PathProgramCache]: Analyzing trace with hash 184374234, now seen corresponding path program 1 times [2023-11-19 07:57:09,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:09,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278375058] [2023-11-19 07:57:09,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:09,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:09,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:57:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:09,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:57:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:09,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:57:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:09,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:57:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:09,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:57:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:09,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:57:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:09,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:57:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:09,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:57:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:57:09,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:09,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278375058] [2023-11-19 07:57:09,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278375058] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:09,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:09,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:57:09,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664484759] [2023-11-19 07:57:09,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:09,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:57:09,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:09,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:57:09,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:57:09,348 INFO L87 Difference]: Start difference. First operand 83 states and 114 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:57:09,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:09,395 INFO L93 Difference]: Finished difference Result 179 states and 247 transitions. [2023-11-19 07:57:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:57:09,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2023-11-19 07:57:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:09,397 INFO L225 Difference]: With dead ends: 179 [2023-11-19 07:57:09,397 INFO L226 Difference]: Without dead ends: 99 [2023-11-19 07:57:09,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-19 07:57:09,398 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 60 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 350 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-19 07:57:09,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 350 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:57:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-19 07:57:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2023-11-19 07:57:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:57:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2023-11-19 07:57:09,408 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 77 [2023-11-19 07:57:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:09,408 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2023-11-19 07:57:09,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:57:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2023-11-19 07:57:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-19 07:57:09,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:09,410 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:57:09,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:57:09,410 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:09,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:09,411 INFO L85 PathProgramCache]: Analyzing trace with hash 376483499, now seen corresponding path program 1 times [2023-11-19 07:57:09,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:09,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468402615] [2023-11-19 07:57:09,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:09,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:09,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:57:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:09,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:57:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:09,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:57:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:09,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:57:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:09,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:57:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:10,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:57:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:10,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:57:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:10,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:57:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:57:10,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:10,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468402615] [2023-11-19 07:57:10,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468402615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:10,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:10,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:57:10,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72620586] [2023-11-19 07:57:10,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:10,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:57:10,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:10,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:57:10,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:57:10,018 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 07:57:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:10,374 INFO L93 Difference]: Finished difference Result 231 states and 312 transitions. [2023-11-19 07:57:10,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:57:10,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2023-11-19 07:57:10,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:10,377 INFO L225 Difference]: With dead ends: 231 [2023-11-19 07:57:10,377 INFO L226 Difference]: Without dead ends: 148 [2023-11-19 07:57:10,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:57:10,378 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 302 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:57:10,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 231 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:57:10,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-19 07:57:10,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 86. [2023-11-19 07:57:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 76 states have internal predecessors, (100), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:57:10,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 116 transitions. [2023-11-19 07:57:10,390 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 116 transitions. Word has length 77 [2023-11-19 07:57:10,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:10,390 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 116 transitions. [2023-11-19 07:57:10,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 07:57:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 116 transitions. [2023-11-19 07:57:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-19 07:57:10,392 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:10,392 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:57:10,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:57:10,393 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:10,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:10,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1126787172, now seen corresponding path program 1 times [2023-11-19 07:57:10,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:10,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568810624] [2023-11-19 07:57:10,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:10,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:11,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:57:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:11,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:57:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:11,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:57:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:11,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:57:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:11,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:57:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:11,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:57:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:11,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:57:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:11,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:57:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:57:11,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:11,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568810624] [2023-11-19 07:57:11,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568810624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:11,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:11,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-19 07:57:11,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722876013] [2023-11-19 07:57:11,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:11,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 07:57:11,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:11,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 07:57:11,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:57:11,155 INFO L87 Difference]: Start difference. First operand 86 states and 116 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 07:57:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:11,732 INFO L93 Difference]: Finished difference Result 239 states and 321 transitions. [2023-11-19 07:57:11,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:57:11,733 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2023-11-19 07:57:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:11,735 INFO L225 Difference]: With dead ends: 239 [2023-11-19 07:57:11,735 INFO L226 Difference]: Without dead ends: 156 [2023-11-19 07:57:11,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2023-11-19 07:57:11,738 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 371 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:57:11,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 369 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:57:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-19 07:57:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 89. [2023-11-19 07:57:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:57:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2023-11-19 07:57:11,756 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 77 [2023-11-19 07:57:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:11,757 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2023-11-19 07:57:11,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 07:57:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2023-11-19 07:57:11,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-19 07:57:11,759 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:11,759 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:57:11,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:57:11,760 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:11,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:11,760 INFO L85 PathProgramCache]: Analyzing trace with hash -736098379, now seen corresponding path program 1 times [2023-11-19 07:57:11,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:11,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305665851] [2023-11-19 07:57:11,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:11,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:57:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:57:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:57:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:57:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:57:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:57:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:57:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:57:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:57:12,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:12,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305665851] [2023-11-19 07:57:12,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305665851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:12,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:12,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:57:12,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159331994] [2023-11-19 07:57:12,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:12,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:57:12,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:12,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:57:12,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:57:12,264 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 07:57:12,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:12,656 INFO L93 Difference]: Finished difference Result 245 states and 329 transitions. [2023-11-19 07:57:12,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:57:12,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2023-11-19 07:57:12,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:12,658 INFO L225 Difference]: With dead ends: 245 [2023-11-19 07:57:12,659 INFO L226 Difference]: Without dead ends: 159 [2023-11-19 07:57:12,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:57:12,660 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 219 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:57:12,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 342 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:57:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-19 07:57:12,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 92. [2023-11-19 07:57:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:57:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2023-11-19 07:57:12,672 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 77 [2023-11-19 07:57:12,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:12,673 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2023-11-19 07:57:12,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 07:57:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2023-11-19 07:57:12,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-19 07:57:12,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:12,674 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:57:12,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:57:12,675 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:12,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:12,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1071179512, now seen corresponding path program 1 times [2023-11-19 07:57:12,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:12,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311908765] [2023-11-19 07:57:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:12,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:57:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:57:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:57:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:57:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:57:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:57:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:57:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:57:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:57:12,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:12,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311908765] [2023-11-19 07:57:12,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311908765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:12,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:12,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:57:12,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399992135] [2023-11-19 07:57:12,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:12,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:57:12,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:12,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:57:12,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:57:12,869 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:57:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:12,958 INFO L93 Difference]: Finished difference Result 211 states and 284 transitions. [2023-11-19 07:57:12,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:57:12,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2023-11-19 07:57:12,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:12,960 INFO L225 Difference]: With dead ends: 211 [2023-11-19 07:57:12,960 INFO L226 Difference]: Without dead ends: 122 [2023-11-19 07:57:12,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:57:12,962 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 80 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:57:12,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 448 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:57:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-19 07:57:12,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2023-11-19 07:57:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:57:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2023-11-19 07:57:12,974 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 79 [2023-11-19 07:57:12,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:12,975 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2023-11-19 07:57:12,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:57:12,975 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2023-11-19 07:57:12,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-19 07:57:12,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:12,977 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:57:12,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:57:12,977 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:12,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:12,978 INFO L85 PathProgramCache]: Analyzing trace with hash 818027873, now seen corresponding path program 1 times [2023-11-19 07:57:12,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:12,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042048758] [2023-11-19 07:57:12,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:12,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:14,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:57:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:14,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:57:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:14,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:57:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:14,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:57:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:14,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:57:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:14,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:57:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:14,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:57:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:14,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:57:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-19 07:57:14,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:14,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042048758] [2023-11-19 07:57:14,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042048758] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:57:14,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850907856] [2023-11-19 07:57:14,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:14,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:57:14,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:57:14,948 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:57:14,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:57:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:15,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-19 07:57:15,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:57:16,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 07:57:17,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-19 07:57:19,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:19,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:19,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-19 07:57:19,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:19,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-19 07:57:19,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:20,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:20,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:20,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2023-11-19 07:57:20,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:20,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-11-19 07:57:20,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-19 07:57:20,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2023-11-19 07:57:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 99 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:57:20,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:57:24,909 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_244 Int) (v_ArrVal_243 Int) (~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (store (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base (store (select |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var2_Pointer~0.offset v_ArrVal_243)) c_~signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer~0.base v_ArrVal_245))) (store .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base (store (select .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset v_ArrVal_244))))) (store .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base (store (select .cse2 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset 4))))) (let ((.cse1 (select (select .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.base) c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer~0.offset))) (< (select (select (store .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base (store (select .cse0 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base) ~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.offset .cse1)) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) .cse1)))) is different from false [2023-11-19 07:57:24,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850907856] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:57:24,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:57:24,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2023-11-19 07:57:24,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364129188] [2023-11-19 07:57:24,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:57:24,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-19 07:57:24,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:24,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-19 07:57:24,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=994, Unknown=13, NotChecked=64, Total=1190 [2023-11-19 07:57:24,957 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand has 27 states, 25 states have (on average 3.6) internal successors, (90), 25 states have internal predecessors, (90), 10 states have call successors, (16), 6 states have call predecessors, (16), 7 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2023-11-19 07:57:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:28,287 INFO L93 Difference]: Finished difference Result 271 states and 351 transitions. [2023-11-19 07:57:28,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-19 07:57:28,288 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.6) internal successors, (90), 25 states have internal predecessors, (90), 10 states have call successors, (16), 6 states have call predecessors, (16), 7 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) Word has length 79 [2023-11-19 07:57:28,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:28,289 INFO L225 Difference]: With dead ends: 271 [2023-11-19 07:57:28,289 INFO L226 Difference]: Without dead ends: 181 [2023-11-19 07:57:28,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=382, Invalid=1961, Unknown=13, NotChecked=94, Total=2450 [2023-11-19 07:57:28,291 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 660 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:57:28,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 762 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-19 07:57:28,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-19 07:57:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 101. [2023-11-19 07:57:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 89 states have internal predecessors, (112), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:57:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2023-11-19 07:57:28,307 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 79 [2023-11-19 07:57:28,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:28,307 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2023-11-19 07:57:28,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.6) internal successors, (90), 25 states have internal predecessors, (90), 10 states have call successors, (16), 6 states have call predecessors, (16), 7 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2023-11-19 07:57:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2023-11-19 07:57:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-19 07:57:28,309 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:28,309 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:57:28,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:57:28,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:57:28,530 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:28,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:28,530 INFO L85 PathProgramCache]: Analyzing trace with hash -6290432, now seen corresponding path program 1 times [2023-11-19 07:57:28,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:28,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865246605] [2023-11-19 07:57:28,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:28,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:28,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:57:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:28,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:57:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:28,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:57:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:28,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:57:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:28,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:57:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:28,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:57:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:28,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:57:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:28,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:57:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:57:28,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:28,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865246605] [2023-11-19 07:57:28,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865246605] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:28,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:28,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:57:28,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278472269] [2023-11-19 07:57:28,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:28,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:57:28,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:28,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:57:28,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:57:28,924 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:57:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:29,328 INFO L93 Difference]: Finished difference Result 272 states and 345 transitions. [2023-11-19 07:57:29,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:57:29,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2023-11-19 07:57:29,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:29,331 INFO L225 Difference]: With dead ends: 272 [2023-11-19 07:57:29,331 INFO L226 Difference]: Without dead ends: 171 [2023-11-19 07:57:29,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:57:29,332 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 189 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:57:29,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 277 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:57:29,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-19 07:57:29,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 98. [2023-11-19 07:57:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 86 states have internal predecessors, (106), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:57:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 122 transitions. [2023-11-19 07:57:29,347 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 122 transitions. Word has length 79 [2023-11-19 07:57:29,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:29,348 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 122 transitions. [2023-11-19 07:57:29,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:57:29,348 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2023-11-19 07:57:29,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-19 07:57:29,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:29,349 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:57:29,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:57:29,350 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:29,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:29,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1512361162, now seen corresponding path program 1 times [2023-11-19 07:57:29,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:29,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147714316] [2023-11-19 07:57:29,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:29,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:30,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:57:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:30,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:57:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:30,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:57:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:30,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:57:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:30,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:57:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:30,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:57:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:30,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:57:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:30,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:57:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:57:30,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:30,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147714316] [2023-11-19 07:57:30,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147714316] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:30,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:30,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-19 07:57:30,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216692330] [2023-11-19 07:57:30,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:30,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-19 07:57:30,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:30,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 07:57:30,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:57:30,752 INFO L87 Difference]: Start difference. First operand 98 states and 122 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-19 07:57:31,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:31,522 INFO L93 Difference]: Finished difference Result 223 states and 280 transitions. [2023-11-19 07:57:31,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:57:31,523 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 79 [2023-11-19 07:57:31,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:31,524 INFO L225 Difference]: With dead ends: 223 [2023-11-19 07:57:31,524 INFO L226 Difference]: Without dead ends: 128 [2023-11-19 07:57:31,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2023-11-19 07:57:31,526 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 465 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:57:31,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 269 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:57:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-19 07:57:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 94. [2023-11-19 07:57:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 82 states have internal predecessors, (101), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:57:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2023-11-19 07:57:31,543 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 79 [2023-11-19 07:57:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:31,544 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2023-11-19 07:57:31,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-19 07:57:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2023-11-19 07:57:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-19 07:57:31,545 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:31,546 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:57:31,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:57:31,546 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:31,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:31,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1012296544, now seen corresponding path program 1 times [2023-11-19 07:57:31,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:31,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435460037] [2023-11-19 07:57:31,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:31,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:31,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:57:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:31,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:57:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:31,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:57:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:31,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:57:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:31,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:57:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:31,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:57:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:31,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:57:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:31,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:57:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:57:31,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:31,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435460037] [2023-11-19 07:57:31,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435460037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:31,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:31,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:57:31,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469343078] [2023-11-19 07:57:31,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:31,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:57:31,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:31,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:57:31,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:57:31,724 INFO L87 Difference]: Start difference. First operand 94 states and 117 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:57:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:31,976 INFO L93 Difference]: Finished difference Result 258 states and 324 transitions. [2023-11-19 07:57:31,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:57:31,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2023-11-19 07:57:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:31,979 INFO L225 Difference]: With dead ends: 258 [2023-11-19 07:57:31,979 INFO L226 Difference]: Without dead ends: 167 [2023-11-19 07:57:31,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-19 07:57:31,982 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 107 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:57:31,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 281 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:57:31,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-19 07:57:31,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 101. [2023-11-19 07:57:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 89 states have internal predecessors, (108), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:57:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2023-11-19 07:57:32,001 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 80 [2023-11-19 07:57:32,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:32,002 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2023-11-19 07:57:32,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-19 07:57:32,002 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2023-11-19 07:57:32,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-19 07:57:32,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:32,005 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:57:32,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:57:32,005 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:32,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:32,006 INFO L85 PathProgramCache]: Analyzing trace with hash -220227388, now seen corresponding path program 1 times [2023-11-19 07:57:32,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:32,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305903607] [2023-11-19 07:57:32,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:32,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:33,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:57:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:33,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:57:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:33,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:57:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:33,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:57:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:33,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:57:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:33,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:57:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:33,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:57:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:33,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:57:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:33,240 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-19 07:57:33,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305903607] [2023-11-19 07:57:33,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305903607] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:33,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:33,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-19 07:57:33,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633000273] [2023-11-19 07:57:33,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:33,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-19 07:57:33,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:33,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-19 07:57:33,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:57:33,243 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-19 07:57:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:57:34,056 INFO L93 Difference]: Finished difference Result 276 states and 341 transitions. [2023-11-19 07:57:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:57:34,057 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 80 [2023-11-19 07:57:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:57:34,059 INFO L225 Difference]: With dead ends: 276 [2023-11-19 07:57:34,059 INFO L226 Difference]: Without dead ends: 178 [2023-11-19 07:57:34,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2023-11-19 07:57:34,060 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 302 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:57:34,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 299 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:57:34,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-19 07:57:34,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 109. [2023-11-19 07:57:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 97 states have (on average 1.1958762886597938) internal successors, (116), 97 states have internal predecessors, (116), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:57:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2023-11-19 07:57:34,097 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 80 [2023-11-19 07:57:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:57:34,097 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2023-11-19 07:57:34,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-19 07:57:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2023-11-19 07:57:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-19 07:57:34,099 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:57:34,099 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 07:57:34,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:57:34,100 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:57:34,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:34,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1059636290, now seen corresponding path program 1 times [2023-11-19 07:57:34,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:34,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138087006] [2023-11-19 07:57:34,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:34,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:36,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:57:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:36,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:57:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:36,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:57:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:36,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:57:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:36,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:57:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:36,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:57:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:36,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:57:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:36,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:57:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-19 07:57:36,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:36,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138087006] [2023-11-19 07:57:36,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138087006] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:57:36,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414223863] [2023-11-19 07:57:36,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:36,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:57:36,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:57:36,748 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:57:36,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbed4662-4e06-4f46-ae15-8963117b3af9/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:57:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:36,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-19 07:57:36,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:57:38,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-19 07:57:38,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 51 [2023-11-19 07:57:38,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-19 07:57:38,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-19 07:57:38,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:57:38,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2023-11-19 07:57:38,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 42 [2023-11-19 07:57:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-19 07:57:39,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:57:39,457 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_364 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_364))) (let ((.cse0 (mod (* 255 (select (select .cse1 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) 256))) (or (< .cse0 128) (= (+ 256 (select (select .cse1 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) .cse0))))) (forall ((v_ArrVal_364 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_364))) (let ((.cse2 (mod (* 255 (select (select .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) 256))) (or (< 127 .cse2) (= (select (select .cse3 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset) .cse2))))) (forall ((v_ArrVal_364 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_364))) (let ((.cse4 (select (select .cse6 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (.cse5 (mod (* 255 (select (select .cse6 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) 256))) (or (= .cse4 .cse5) (= (+ 256 .cse4) .cse5)))))) is different from false [2023-11-19 07:57:39,586 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base)) (.cse9 (mod |c_ULTIMATE.start_step_#t~ite17#1| 256))) (and (or (let ((.cse2 (store |c_#memory_int| c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base (store .cse8 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset .cse9)))) (and (forall ((v_ArrVal_364 (Array Int Int))) (let ((.cse1 (store .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_364))) (let ((.cse0 (mod (* 255 (select (select .cse1 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) 256))) (or (< 127 .cse0) (= (select (select .cse1 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset) .cse0))))) (forall ((v_ArrVal_364 (Array Int Int))) (let ((.cse4 (store .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_364))) (let ((.cse3 (mod (* 255 (select (select .cse4 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) 256))) (or (< .cse3 128) (= (+ 256 (select (select .cse4 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) .cse3))))) (forall ((v_ArrVal_364 (Array Int Int))) (let ((.cse7 (store .cse2 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_364))) (let ((.cse5 (select (select .cse7 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)) (.cse6 (mod (* 255 (select (select .cse7 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) 256))) (or (= (+ 256 .cse5) .cse6) (= .cse5 .cse6))))))) (< 127 .cse9)) (or (let ((.cse13 (store |c_#memory_int| c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base (store .cse8 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset (+ (- 256) .cse9))))) (and (forall ((v_ArrVal_364 (Array Int Int))) (let ((.cse12 (store .cse13 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_364))) (let ((.cse10 (mod (* 255 (select (select .cse12 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) 256)) (.cse11 (select (select .cse12 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset))) (or (= .cse10 (+ .cse11 256)) (= .cse10 .cse11))))) (forall ((v_ArrVal_364 (Array Int Int))) (let ((.cse15 (store .cse13 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_364))) (let ((.cse14 (mod (* 255 (select (select .cse15 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) 256))) (or (< 127 .cse14) (= .cse14 (select (select .cse15 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset)))))) (forall ((v_ArrVal_364 (Array Int Int))) (let ((.cse17 (store .cse13 c_~signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer~0.base v_ArrVal_364))) (let ((.cse16 (mod (* 255 (select (select .cse17 c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset)) 256))) (or (< .cse16 128) (= .cse16 (+ (select (select .cse17 c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer~0.offset) 256)))))))) (< .cse9 128)))) is different from false [2023-11-19 07:57:43,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:57:43,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10655356 treesize of output 10439168 [2023-11-19 07:57:45,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12397 treesize of output 12175 [2023-11-19 07:57:46,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:57:46,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12135 treesize of output 11816 [2023-11-19 07:57:46,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12392 treesize of output 11948 [2023-11-19 07:57:47,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:57:47,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11887 treesize of output 11400 [2023-11-19 07:57:47,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:57:47,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11391 treesize of output 11120