./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be --witnessprinter.witness.filename witness.graphml --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 b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 20:08:32,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 20:08:32,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 20:08:32,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 20:08:32,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 20:08:32,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 20:08:32,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 20:08:32,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 20:08:32,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 20:08:32,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 20:08:32,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 20:08:32,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 20:08:32,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 20:08:32,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 20:08:32,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 20:08:32,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 20:08:32,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 20:08:32,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 20:08:32,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 20:08:32,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 20:08:32,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 20:08:32,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 20:08:32,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 20:08:32,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 20:08:32,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 20:08:32,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 20:08:32,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 20:08:32,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 20:08:32,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 20:08:32,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 20:08:32,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 20:08:32,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 20:08:32,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 20:08:32,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 20:08:32,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 20:08:32,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 20:08:32,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 20:08:32,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 20:08:32,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 20:08:32,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 20:08:32,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 20:08:32,262 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-21 20:08:32,320 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 20:08:32,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 20:08:32,321 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 20:08:32,321 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 20:08:32,331 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 20:08:32,331 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 20:08:32,332 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 20:08:32,332 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 20:08:32,332 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 20:08:32,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 20:08:32,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 20:08:32,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 20:08:32,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-21 20:08:32,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 20:08:32,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-21 20:08:32,336 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 20:08:32,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 20:08:32,337 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 20:08:32,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-21 20:08:32,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 20:08:32,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 20:08:32,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 20:08:32,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:08:32,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 20:08:32,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 20:08:32,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-21 20:08:32,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 20:08:32,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 20:08:32,340 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-21 20:08:32,343 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-21 20:08:32,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-21 20:08:32,343 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 20:08:32,344 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be/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_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2021-10-21 20:08:32,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 20:08:32,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 20:08:32,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 20:08:32,823 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 20:08:32,825 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 20:08:32,826 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/locks/test_locks_8.c [2021-10-21 20:08:32,907 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be/data/f8c3a858c/40047fcb9823419b8c3b7af135b07d33/FLAG9e636d0bf [2021-10-21 20:08:33,530 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 20:08:33,536 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13f31f2e-c078-47f4-a7f9-0fb598063164/sv-benchmarks/c/locks/test_locks_8.c [2021-10-21 20:08:33,550 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be/data/f8c3a858c/40047fcb9823419b8c3b7af135b07d33/FLAG9e636d0bf [2021-10-21 20:08:33,834 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be/data/f8c3a858c/40047fcb9823419b8c3b7af135b07d33 [2021-10-21 20:08:33,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 20:08:33,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 20:08:33,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 20:08:33,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 20:08:33,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 20:08:33,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:08:33" (1/1) ... [2021-10-21 20:08:33,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd7a3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:08:33, skipping insertion in model container [2021-10-21 20:08:33,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:08:33" (1/1) ... [2021-10-21 20:08:33,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 20:08:33,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 20:08:34,180 WARN L228 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_13f31f2e-c078-47f4-a7f9-0fb598063164/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2021-10-21 20:08:34,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:08:34,217 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 20:08:34,266 WARN L228 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_13f31f2e-c078-47f4-a7f9-0fb598063164/sv-benchmarks/c/locks/test_locks_8.c[3218,3231] [2021-10-21 20:08:34,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:08:34,301 INFO L208 MainTranslator]: Completed translation [2021-10-21 20:08:34,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:08:34 WrapperNode [2021-10-21 20:08:34,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 20:08:34,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 20:08:34,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 20:08:34,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 20:08:34,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:08:34" (1/1) ... [2021-10-21 20:08:34,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:08:34" (1/1) ... [2021-10-21 20:08:34,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 20:08:34,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 20:08:34,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 20:08:34,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 20:08:34,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:08:34" (1/1) ... [2021-10-21 20:08:34,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:08:34" (1/1) ... [2021-10-21 20:08:34,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:08:34" (1/1) ... [2021-10-21 20:08:34,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:08:34" (1/1) ... [2021-10-21 20:08:34,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:08:34" (1/1) ... [2021-10-21 20:08:34,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:08:34" (1/1) ... [2021-10-21 20:08:34,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:08:34" (1/1) ... [2021-10-21 20:08:34,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 20:08:34,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 20:08:34,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 20:08:34,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 20:08:34,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:08:34" (1/1) ... [2021-10-21 20:08:34,449 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:08:34,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:08:34,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 20:08:34,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 20:08:34,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 20:08:34,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 20:08:34,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 20:08:34,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 20:08:34,923 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 20:08:34,923 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-21 20:08:34,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:08:34 BoogieIcfgContainer [2021-10-21 20:08:34,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 20:08:34,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 20:08:34,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 20:08:34,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 20:08:34,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 08:08:33" (1/3) ... [2021-10-21 20:08:34,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b71d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:08:34, skipping insertion in model container [2021-10-21 20:08:34,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:08:34" (2/3) ... [2021-10-21 20:08:34,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b71d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:08:34, skipping insertion in model container [2021-10-21 20:08:34,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:08:34" (3/3) ... [2021-10-21 20:08:34,938 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2021-10-21 20:08:34,945 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 20:08:34,946 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-21 20:08:35,008 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 20:08:35,017 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-21 20:08:35,018 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-21 20:08:35,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:35,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-21 20:08:35,045 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:35,045 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:35,046 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:35,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:35,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1577492323, now seen corresponding path program 1 times [2021-10-21 20:08:35,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:35,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991643749] [2021-10-21 20:08:35,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:35,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:35,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:35,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:35,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991643749] [2021-10-21 20:08:35,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991643749] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:35,382 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:35,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:35,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667160765] [2021-10-21 20:08:35,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:35,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:35,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:35,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:35,415 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:35,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:35,466 INFO L93 Difference]: Finished difference Result 71 states and 121 transitions. [2021-10-21 20:08:35,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:35,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-21 20:08:35,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:35,480 INFO L225 Difference]: With dead ends: 71 [2021-10-21 20:08:35,481 INFO L226 Difference]: Without dead ends: 57 [2021-10-21 20:08:35,484 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-10-21 20:08:35,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2021-10-21 20:08:35,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 70 transitions. [2021-10-21 20:08:35,534 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 70 transitions. Word has length 15 [2021-10-21 20:08:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:35,535 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 70 transitions. [2021-10-21 20:08:35,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:35,535 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 70 transitions. [2021-10-21 20:08:35,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-21 20:08:35,537 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:35,537 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:35,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 20:08:35,538 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:35,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:35,539 INFO L82 PathProgramCache]: Analyzing trace with hash -876427745, now seen corresponding path program 1 times [2021-10-21 20:08:35,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:35,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453478015] [2021-10-21 20:08:35,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:35,541 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:35,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:35,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453478015] [2021-10-21 20:08:35,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453478015] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:35,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:35,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:35,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309722205] [2021-10-21 20:08:35,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:35,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:35,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:35,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:35,631 INFO L87 Difference]: Start difference. First operand 39 states and 70 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:35,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:35,676 INFO L93 Difference]: Finished difference Result 94 states and 169 transitions. [2021-10-21 20:08:35,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:35,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-21 20:08:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:35,680 INFO L225 Difference]: With dead ends: 94 [2021-10-21 20:08:35,681 INFO L226 Difference]: Without dead ends: 57 [2021-10-21 20:08:35,682 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-10-21 20:08:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2021-10-21 20:08:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2021-10-21 20:08:35,705 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 15 [2021-10-21 20:08:35,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:35,705 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2021-10-21 20:08:35,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:35,705 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2021-10-21 20:08:35,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-21 20:08:35,707 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:35,707 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:35,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 20:08:35,708 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:35,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:35,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1657407761, now seen corresponding path program 1 times [2021-10-21 20:08:35,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:35,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28157879] [2021-10-21 20:08:35,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:35,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:35,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:35,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28157879] [2021-10-21 20:08:35,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28157879] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:35,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:35,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:35,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095937984] [2021-10-21 20:08:35,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:35,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:35,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:35,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:35,813 INFO L87 Difference]: Start difference. First operand 55 states and 98 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:35,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:35,834 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2021-10-21 20:08:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:35,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-21 20:08:35,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:35,836 INFO L225 Difference]: With dead ends: 87 [2021-10-21 20:08:35,837 INFO L226 Difference]: Without dead ends: 60 [2021-10-21 20:08:35,838 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:35,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-10-21 20:08:35,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2021-10-21 20:08:35,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 57 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2021-10-21 20:08:35,878 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 16 [2021-10-21 20:08:35,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:35,879 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2021-10-21 20:08:35,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2021-10-21 20:08:35,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-21 20:08:35,882 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:35,882 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:35,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 20:08:35,882 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:35,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:35,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1399242323, now seen corresponding path program 1 times [2021-10-21 20:08:35,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:35,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970998939] [2021-10-21 20:08:35,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:35,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:36,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:36,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970998939] [2021-10-21 20:08:36,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970998939] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:36,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:36,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:36,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671903076] [2021-10-21 20:08:36,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:36,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:36,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:36,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:36,022 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:36,081 INFO L93 Difference]: Finished difference Result 109 states and 189 transitions. [2021-10-21 20:08:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:36,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-21 20:08:36,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:36,085 INFO L225 Difference]: With dead ends: 109 [2021-10-21 20:08:36,090 INFO L226 Difference]: Without dead ends: 107 [2021-10-21 20:08:36,091 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:36,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-10-21 20:08:36,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2021-10-21 20:08:36,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.75) internal successors, (133), 76 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 133 transitions. [2021-10-21 20:08:36,111 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 133 transitions. Word has length 16 [2021-10-21 20:08:36,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:36,112 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 133 transitions. [2021-10-21 20:08:36,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 133 transitions. [2021-10-21 20:08:36,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-21 20:08:36,114 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:36,115 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:36,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 20:08:36,115 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:36,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:36,117 INFO L82 PathProgramCache]: Analyzing trace with hash -698177745, now seen corresponding path program 1 times [2021-10-21 20:08:36,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:36,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123395924] [2021-10-21 20:08:36,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:36,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:36,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:36,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123395924] [2021-10-21 20:08:36,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123395924] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:36,230 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:36,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:36,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462237000] [2021-10-21 20:08:36,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:36,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:36,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:36,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:36,233 INFO L87 Difference]: Start difference. First operand 77 states and 133 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:36,261 INFO L93 Difference]: Finished difference Result 181 states and 315 transitions. [2021-10-21 20:08:36,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:36,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-21 20:08:36,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:36,264 INFO L225 Difference]: With dead ends: 181 [2021-10-21 20:08:36,264 INFO L226 Difference]: Without dead ends: 109 [2021-10-21 20:08:36,265 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-10-21 20:08:36,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2021-10-21 20:08:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 106 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 183 transitions. [2021-10-21 20:08:36,284 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 183 transitions. Word has length 16 [2021-10-21 20:08:36,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:36,285 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 183 transitions. [2021-10-21 20:08:36,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,285 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 183 transitions. [2021-10-21 20:08:36,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-21 20:08:36,287 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:36,287 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:36,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 20:08:36,288 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:36,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:36,289 INFO L82 PathProgramCache]: Analyzing trace with hash -426624716, now seen corresponding path program 1 times [2021-10-21 20:08:36,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:36,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648505407] [2021-10-21 20:08:36,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:36,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:36,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:36,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648505407] [2021-10-21 20:08:36,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648505407] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:36,349 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:36,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:36,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889627619] [2021-10-21 20:08:36,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:36,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:36,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:36,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:36,352 INFO L87 Difference]: Start difference. First operand 107 states and 183 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:36,374 INFO L93 Difference]: Finished difference Result 162 states and 274 transitions. [2021-10-21 20:08:36,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:36,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-21 20:08:36,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:36,377 INFO L225 Difference]: With dead ends: 162 [2021-10-21 20:08:36,378 INFO L226 Difference]: Without dead ends: 111 [2021-10-21 20:08:36,379 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-10-21 20:08:36,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2021-10-21 20:08:36,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 108 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 183 transitions. [2021-10-21 20:08:36,397 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 183 transitions. Word has length 17 [2021-10-21 20:08:36,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:36,397 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 183 transitions. [2021-10-21 20:08:36,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,398 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 183 transitions. [2021-10-21 20:08:36,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-21 20:08:36,400 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:36,400 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:36,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 20:08:36,401 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:36,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:36,402 INFO L82 PathProgramCache]: Analyzing trace with hash -168459278, now seen corresponding path program 1 times [2021-10-21 20:08:36,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:36,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412671389] [2021-10-21 20:08:36,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:36,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:36,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:36,478 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412671389] [2021-10-21 20:08:36,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412671389] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:36,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:36,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:36,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702138488] [2021-10-21 20:08:36,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:36,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:36,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:36,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:36,482 INFO L87 Difference]: Start difference. First operand 109 states and 183 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:36,520 INFO L93 Difference]: Finished difference Result 309 states and 521 transitions. [2021-10-21 20:08:36,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:36,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-21 20:08:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:36,524 INFO L225 Difference]: With dead ends: 309 [2021-10-21 20:08:36,524 INFO L226 Difference]: Without dead ends: 207 [2021-10-21 20:08:36,526 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:36,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-10-21 20:08:36,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2021-10-21 20:08:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.661764705882353) internal successors, (339), 204 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 339 transitions. [2021-10-21 20:08:36,584 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 339 transitions. Word has length 17 [2021-10-21 20:08:36,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:36,585 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 339 transitions. [2021-10-21 20:08:36,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 339 transitions. [2021-10-21 20:08:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-21 20:08:36,593 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:36,594 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:36,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 20:08:36,595 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:36,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:36,596 INFO L82 PathProgramCache]: Analyzing trace with hash -869523856, now seen corresponding path program 1 times [2021-10-21 20:08:36,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:36,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755505715] [2021-10-21 20:08:36,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:36,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:36,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:36,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:36,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755505715] [2021-10-21 20:08:36,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755505715] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:36,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:36,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:36,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178407885] [2021-10-21 20:08:36,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:36,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:36,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:36,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:36,668 INFO L87 Difference]: Start difference. First operand 205 states and 339 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:36,713 INFO L93 Difference]: Finished difference Result 257 states and 429 transitions. [2021-10-21 20:08:36,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:36,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-21 20:08:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:36,717 INFO L225 Difference]: With dead ends: 257 [2021-10-21 20:08:36,718 INFO L226 Difference]: Without dead ends: 255 [2021-10-21 20:08:36,719 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-10-21 20:08:36,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 205. [2021-10-21 20:08:36,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.642156862745098) internal successors, (335), 204 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 335 transitions. [2021-10-21 20:08:36,750 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 335 transitions. Word has length 17 [2021-10-21 20:08:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:36,751 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 335 transitions. [2021-10-21 20:08:36,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 335 transitions. [2021-10-21 20:08:36,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-21 20:08:36,762 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:36,762 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:36,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 20:08:36,765 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:36,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:36,766 INFO L82 PathProgramCache]: Analyzing trace with hash -927055644, now seen corresponding path program 1 times [2021-10-21 20:08:36,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:36,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843469180] [2021-10-21 20:08:36,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:36,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:36,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:36,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843469180] [2021-10-21 20:08:36,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843469180] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:36,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:36,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:36,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504483556] [2021-10-21 20:08:36,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:36,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:36,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:36,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:36,818 INFO L87 Difference]: Start difference. First operand 205 states and 335 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:36,841 INFO L93 Difference]: Finished difference Result 373 states and 617 transitions. [2021-10-21 20:08:36,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:36,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-21 20:08:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:36,846 INFO L225 Difference]: With dead ends: 373 [2021-10-21 20:08:36,846 INFO L226 Difference]: Without dead ends: 371 [2021-10-21 20:08:36,847 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-10-21 20:08:36,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 289. [2021-10-21 20:08:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.6076388888888888) internal successors, (463), 288 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 463 transitions. [2021-10-21 20:08:36,873 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 463 transitions. Word has length 18 [2021-10-21 20:08:36,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:36,873 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 463 transitions. [2021-10-21 20:08:36,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 463 transitions. [2021-10-21 20:08:36,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-21 20:08:36,877 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:36,877 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:36,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 20:08:36,877 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:36,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:36,878 INFO L82 PathProgramCache]: Analyzing trace with hash -225991066, now seen corresponding path program 1 times [2021-10-21 20:08:36,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:36,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460035813] [2021-10-21 20:08:36,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:36,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:36,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:36,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460035813] [2021-10-21 20:08:36,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460035813] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:36,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:36,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:36,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850417722] [2021-10-21 20:08:36,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:36,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:36,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:36,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:36,955 INFO L87 Difference]: Start difference. First operand 289 states and 463 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:37,006 INFO L93 Difference]: Finished difference Result 677 states and 1089 transitions. [2021-10-21 20:08:37,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:37,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-21 20:08:37,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:37,011 INFO L225 Difference]: With dead ends: 677 [2021-10-21 20:08:37,011 INFO L226 Difference]: Without dead ends: 395 [2021-10-21 20:08:37,014 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:37,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-10-21 20:08:37,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2021-10-21 20:08:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.5790816326530612) internal successors, (619), 392 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 619 transitions. [2021-10-21 20:08:37,062 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 619 transitions. Word has length 18 [2021-10-21 20:08:37,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:37,063 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 619 transitions. [2021-10-21 20:08:37,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 619 transitions. [2021-10-21 20:08:37,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-21 20:08:37,066 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:37,066 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:37,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 20:08:37,067 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:37,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:37,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1326261127, now seen corresponding path program 1 times [2021-10-21 20:08:37,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:37,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134211930] [2021-10-21 20:08:37,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:37,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:37,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:37,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134211930] [2021-10-21 20:08:37,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134211930] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:37,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:37,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:37,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48279569] [2021-10-21 20:08:37,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:37,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:37,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:37,109 INFO L87 Difference]: Start difference. First operand 393 states and 619 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:37,135 INFO L93 Difference]: Finished difference Result 597 states and 937 transitions. [2021-10-21 20:08:37,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:37,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-21 20:08:37,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:37,140 INFO L225 Difference]: With dead ends: 597 [2021-10-21 20:08:37,141 INFO L226 Difference]: Without dead ends: 407 [2021-10-21 20:08:37,142 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:37,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-10-21 20:08:37,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2021-10-21 20:08:37,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.551980198019802) internal successors, (627), 404 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 627 transitions. [2021-10-21 20:08:37,166 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 627 transitions. Word has length 19 [2021-10-21 20:08:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:37,167 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 627 transitions. [2021-10-21 20:08:37,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 627 transitions. [2021-10-21 20:08:37,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-21 20:08:37,169 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:37,169 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:37,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-21 20:08:37,170 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:37,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:37,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1584426565, now seen corresponding path program 1 times [2021-10-21 20:08:37,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:37,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968068278] [2021-10-21 20:08:37,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:37,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:37,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:37,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968068278] [2021-10-21 20:08:37,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968068278] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:37,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:37,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:37,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225565469] [2021-10-21 20:08:37,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:37,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:37,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:37,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:37,211 INFO L87 Difference]: Start difference. First operand 405 states and 627 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:37,258 INFO L93 Difference]: Finished difference Result 713 states and 1117 transitions. [2021-10-21 20:08:37,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:37,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-21 20:08:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:37,265 INFO L225 Difference]: With dead ends: 713 [2021-10-21 20:08:37,265 INFO L226 Difference]: Without dead ends: 711 [2021-10-21 20:08:37,266 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:37,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-10-21 20:08:37,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 581. [2021-10-21 20:08:37,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.5086206896551724) internal successors, (875), 580 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 875 transitions. [2021-10-21 20:08:37,332 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 875 transitions. Word has length 19 [2021-10-21 20:08:37,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:37,332 INFO L470 AbstractCegarLoop]: Abstraction has 581 states and 875 transitions. [2021-10-21 20:08:37,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 875 transitions. [2021-10-21 20:08:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-21 20:08:37,335 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:37,335 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:37,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 20:08:37,336 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:37,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:37,337 INFO L82 PathProgramCache]: Analyzing trace with hash -2009476153, now seen corresponding path program 1 times [2021-10-21 20:08:37,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:37,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256125852] [2021-10-21 20:08:37,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:37,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:37,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:37,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:37,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256125852] [2021-10-21 20:08:37,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256125852] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:37,439 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:37,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:37,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992003207] [2021-10-21 20:08:37,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:37,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:37,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:37,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:37,441 INFO L87 Difference]: Start difference. First operand 581 states and 875 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:37,491 INFO L93 Difference]: Finished difference Result 1337 states and 2013 transitions. [2021-10-21 20:08:37,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:37,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-21 20:08:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:37,499 INFO L225 Difference]: With dead ends: 1337 [2021-10-21 20:08:37,499 INFO L226 Difference]: Without dead ends: 775 [2021-10-21 20:08:37,500 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:37,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-10-21 20:08:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 773. [2021-10-21 20:08:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4753886010362693) internal successors, (1139), 772 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1139 transitions. [2021-10-21 20:08:37,541 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1139 transitions. Word has length 19 [2021-10-21 20:08:37,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:37,542 INFO L470 AbstractCegarLoop]: Abstraction has 773 states and 1139 transitions. [2021-10-21 20:08:37,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,542 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1139 transitions. [2021-10-21 20:08:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-21 20:08:37,545 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:37,545 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:37,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-21 20:08:37,545 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:37,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1872798619, now seen corresponding path program 1 times [2021-10-21 20:08:37,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:37,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781608411] [2021-10-21 20:08:37,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:37,547 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:37,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:37,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:37,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781608411] [2021-10-21 20:08:37,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781608411] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:37,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:37,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:37,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384003207] [2021-10-21 20:08:37,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:37,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:37,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:37,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:37,584 INFO L87 Difference]: Start difference. First operand 773 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:37,615 INFO L93 Difference]: Finished difference Result 1161 states and 1701 transitions. [2021-10-21 20:08:37,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:37,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-21 20:08:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:37,622 INFO L225 Difference]: With dead ends: 1161 [2021-10-21 20:08:37,622 INFO L226 Difference]: Without dead ends: 791 [2021-10-21 20:08:37,623 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:37,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-10-21 20:08:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 789. [2021-10-21 20:08:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.4454314720812182) internal successors, (1139), 788 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1139 transitions. [2021-10-21 20:08:37,662 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1139 transitions. Word has length 20 [2021-10-21 20:08:37,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:37,663 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1139 transitions. [2021-10-21 20:08:37,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1139 transitions. [2021-10-21 20:08:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-21 20:08:37,665 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:37,665 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:37,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-21 20:08:37,666 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:37,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:37,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2130964057, now seen corresponding path program 1 times [2021-10-21 20:08:37,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:37,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277720894] [2021-10-21 20:08:37,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:37,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:37,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:37,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277720894] [2021-10-21 20:08:37,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277720894] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:37,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:37,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:37,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843351033] [2021-10-21 20:08:37,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:37,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:37,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:37,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:37,707 INFO L87 Difference]: Start difference. First operand 789 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:37,760 INFO L93 Difference]: Finished difference Result 1353 states and 1973 transitions. [2021-10-21 20:08:37,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:37,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-21 20:08:37,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:37,771 INFO L225 Difference]: With dead ends: 1353 [2021-10-21 20:08:37,771 INFO L226 Difference]: Without dead ends: 1351 [2021-10-21 20:08:37,774 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:37,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2021-10-21 20:08:37,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1157. [2021-10-21 20:08:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.4005190311418685) internal successors, (1619), 1156 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1619 transitions. [2021-10-21 20:08:37,836 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1619 transitions. Word has length 20 [2021-10-21 20:08:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:37,836 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 1619 transitions. [2021-10-21 20:08:37,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1619 transitions. [2021-10-21 20:08:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-21 20:08:37,840 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:37,840 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:37,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-21 20:08:37,844 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:37,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:37,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1462938661, now seen corresponding path program 1 times [2021-10-21 20:08:37,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:37,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186614118] [2021-10-21 20:08:37,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:37,845 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:37,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:37,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186614118] [2021-10-21 20:08:37,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186614118] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:37,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:37,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:37,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132129707] [2021-10-21 20:08:37,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:37,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:37,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:37,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:37,913 INFO L87 Difference]: Start difference. First operand 1157 states and 1619 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:37,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:37,972 INFO L93 Difference]: Finished difference Result 2633 states and 3669 transitions. [2021-10-21 20:08:37,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:37,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-21 20:08:37,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:37,985 INFO L225 Difference]: With dead ends: 2633 [2021-10-21 20:08:37,985 INFO L226 Difference]: Without dead ends: 1511 [2021-10-21 20:08:37,987 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:37,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2021-10-21 20:08:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1509. [2021-10-21 20:08:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 1.360079575596817) internal successors, (2051), 1508 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2051 transitions. [2021-10-21 20:08:38,072 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2051 transitions. Word has length 20 [2021-10-21 20:08:38,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:38,075 INFO L470 AbstractCegarLoop]: Abstraction has 1509 states and 2051 transitions. [2021-10-21 20:08:38,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2051 transitions. [2021-10-21 20:08:38,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-21 20:08:38,078 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:38,079 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:38,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-21 20:08:38,079 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:38,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:38,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1635592028, now seen corresponding path program 1 times [2021-10-21 20:08:38,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:38,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163545394] [2021-10-21 20:08:38,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:38,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:38,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:38,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163545394] [2021-10-21 20:08:38,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163545394] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:38,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:38,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:38,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439864747] [2021-10-21 20:08:38,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:38,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:38,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:38,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:38,140 INFO L87 Difference]: Start difference. First operand 1509 states and 2051 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:38,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:38,183 INFO L93 Difference]: Finished difference Result 2265 states and 3061 transitions. [2021-10-21 20:08:38,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:38,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-21 20:08:38,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:38,195 INFO L225 Difference]: With dead ends: 2265 [2021-10-21 20:08:38,195 INFO L226 Difference]: Without dead ends: 1543 [2021-10-21 20:08:38,197 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:38,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2021-10-21 20:08:38,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1541. [2021-10-21 20:08:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.3318181818181818) internal successors, (2051), 1540 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2051 transitions. [2021-10-21 20:08:38,271 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2051 transitions. Word has length 21 [2021-10-21 20:08:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:38,272 INFO L470 AbstractCegarLoop]: Abstraction has 1541 states and 2051 transitions. [2021-10-21 20:08:38,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2051 transitions. [2021-10-21 20:08:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-21 20:08:38,275 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:38,276 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:38,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-21 20:08:38,276 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:38,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:38,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1893757466, now seen corresponding path program 1 times [2021-10-21 20:08:38,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:38,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701903178] [2021-10-21 20:08:38,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:38,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:38,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:38,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701903178] [2021-10-21 20:08:38,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701903178] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:38,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:38,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:38,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110339422] [2021-10-21 20:08:38,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:38,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:38,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:38,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:38,311 INFO L87 Difference]: Start difference. First operand 1541 states and 2051 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:38,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:38,373 INFO L93 Difference]: Finished difference Result 2569 states and 3429 transitions. [2021-10-21 20:08:38,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:38,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-21 20:08:38,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:38,392 INFO L225 Difference]: With dead ends: 2569 [2021-10-21 20:08:38,392 INFO L226 Difference]: Without dead ends: 2567 [2021-10-21 20:08:38,393 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:38,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2021-10-21 20:08:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2309. [2021-10-21 20:08:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.290727902946274) internal successors, (2979), 2308 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 2979 transitions. [2021-10-21 20:08:38,494 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 2979 transitions. Word has length 21 [2021-10-21 20:08:38,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:38,495 INFO L470 AbstractCegarLoop]: Abstraction has 2309 states and 2979 transitions. [2021-10-21 20:08:38,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2979 transitions. [2021-10-21 20:08:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-21 20:08:38,500 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:38,500 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:38,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-21 20:08:38,500 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:38,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:38,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1700145252, now seen corresponding path program 1 times [2021-10-21 20:08:38,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:38,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56847697] [2021-10-21 20:08:38,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:38,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:38,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:38,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56847697] [2021-10-21 20:08:38,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56847697] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:38,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:38,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:38,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845117416] [2021-10-21 20:08:38,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:38,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:38,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:38,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:38,529 INFO L87 Difference]: Start difference. First operand 2309 states and 2979 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:38,621 INFO L93 Difference]: Finished difference Result 5193 states and 6629 transitions. [2021-10-21 20:08:38,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:38,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-21 20:08:38,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:38,641 INFO L225 Difference]: With dead ends: 5193 [2021-10-21 20:08:38,641 INFO L226 Difference]: Without dead ends: 2951 [2021-10-21 20:08:38,645 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2021-10-21 20:08:38,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2949. [2021-10-21 20:08:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2948 states have (on average 1.2384667571234735) internal successors, (3651), 2948 states have internal predecessors, (3651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3651 transitions. [2021-10-21 20:08:38,797 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3651 transitions. Word has length 21 [2021-10-21 20:08:38,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:38,797 INFO L470 AbstractCegarLoop]: Abstraction has 2949 states and 3651 transitions. [2021-10-21 20:08:38,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3651 transitions. [2021-10-21 20:08:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-21 20:08:38,803 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:38,803 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:38,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-21 20:08:38,803 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:38,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:38,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1422844656, now seen corresponding path program 1 times [2021-10-21 20:08:38,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:38,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297178957] [2021-10-21 20:08:38,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:38,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:38,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:38,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297178957] [2021-10-21 20:08:38,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297178957] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:38,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:38,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:38,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998634183] [2021-10-21 20:08:38,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:38,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:38,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:38,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:38,854 INFO L87 Difference]: Start difference. First operand 2949 states and 3651 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:38,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:38,939 INFO L93 Difference]: Finished difference Result 4425 states and 5445 transitions. [2021-10-21 20:08:38,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:38,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-21 20:08:38,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:38,962 INFO L225 Difference]: With dead ends: 4425 [2021-10-21 20:08:38,963 INFO L226 Difference]: Without dead ends: 3015 [2021-10-21 20:08:38,966 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2021-10-21 20:08:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 3013. [2021-10-21 20:08:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 3012 states have (on average 1.2121513944223108) internal successors, (3651), 3012 states have internal predecessors, (3651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:39,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 3651 transitions. [2021-10-21 20:08:39,139 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 3651 transitions. Word has length 22 [2021-10-21 20:08:39,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:39,139 INFO L470 AbstractCegarLoop]: Abstraction has 3013 states and 3651 transitions. [2021-10-21 20:08:39,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:39,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 3651 transitions. [2021-10-21 20:08:39,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-21 20:08:39,149 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:39,150 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:39,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-21 20:08:39,153 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:39,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:39,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1164679218, now seen corresponding path program 1 times [2021-10-21 20:08:39,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:39,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693216383] [2021-10-21 20:08:39,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:39,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:39,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:39,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693216383] [2021-10-21 20:08:39,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693216383] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:39,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:39,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:39,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809048915] [2021-10-21 20:08:39,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:39,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:39,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:39,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:39,209 INFO L87 Difference]: Start difference. First operand 3013 states and 3651 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:39,335 INFO L93 Difference]: Finished difference Result 4871 states and 5828 transitions. [2021-10-21 20:08:39,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:39,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-21 20:08:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:39,367 INFO L225 Difference]: With dead ends: 4871 [2021-10-21 20:08:39,367 INFO L226 Difference]: Without dead ends: 4869 [2021-10-21 20:08:39,369 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:39,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2021-10-21 20:08:39,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4613. [2021-10-21 20:08:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4613 states, 4612 states have (on average 1.180182133564614) internal successors, (5443), 4612 states have internal predecessors, (5443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 5443 transitions. [2021-10-21 20:08:39,605 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 5443 transitions. Word has length 22 [2021-10-21 20:08:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:39,605 INFO L470 AbstractCegarLoop]: Abstraction has 4613 states and 5443 transitions. [2021-10-21 20:08:39,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 5443 transitions. [2021-10-21 20:08:39,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-21 20:08:39,615 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:08:39,616 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:08:39,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-21 20:08:39,616 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:08:39,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:08:39,617 INFO L82 PathProgramCache]: Analyzing trace with hash -463614640, now seen corresponding path program 1 times [2021-10-21 20:08:39,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:08:39,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512903249] [2021-10-21 20:08:39,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:08:39,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:08:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:08:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:39,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:08:39,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512903249] [2021-10-21 20:08:39,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512903249] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:08:39,672 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:08:39,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:08:39,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966476952] [2021-10-21 20:08:39,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:08:39,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:08:39,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:08:39,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:39,676 INFO L87 Difference]: Start difference. First operand 4613 states and 5443 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:08:39,863 INFO L93 Difference]: Finished difference Result 10245 states and 11843 transitions. [2021-10-21 20:08:39,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:08:39,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-21 20:08:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:08:39,864 INFO L225 Difference]: With dead ends: 10245 [2021-10-21 20:08:39,864 INFO L226 Difference]: Without dead ends: 0 [2021-10-21 20:08:39,876 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:08:39,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-21 20:08:39,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-21 20:08:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-21 20:08:39,878 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2021-10-21 20:08:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:08:39,878 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-21 20:08:39,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:08:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-21 20:08:39,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-21 20:08:39,882 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 20:08:39,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-21 20:08:39,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-21 20:08:39,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:08:39,900 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:08:39,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:08:39,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:08:39,911 INFO L857 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2021-10-21 20:08:39,912 INFO L857 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2021-10-21 20:08:39,912 INFO L857 garLoopResultBuilder]: For program point L102-1(lines 35 132) no Hoare annotation was computed. [2021-10-21 20:08:39,912 INFO L860 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2021-10-21 20:08:39,912 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-21 20:08:39,913 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-21 20:08:39,913 INFO L857 garLoopResultBuilder]: For program point L86-1(lines 35 132) no Hoare annotation was computed. [2021-10-21 20:08:39,913 INFO L857 garLoopResultBuilder]: For program point L78-1(lines 35 132) no Hoare annotation was computed. [2021-10-21 20:08:39,913 INFO L860 garLoopResultBuilder]: At program point L136(lines 6 137) the Hoare annotation is: true [2021-10-21 20:08:39,913 INFO L857 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2021-10-21 20:08:39,914 INFO L857 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2021-10-21 20:08:39,914 INFO L857 garLoopResultBuilder]: For program point L70-1(lines 35 132) no Hoare annotation was computed. [2021-10-21 20:08:39,914 INFO L857 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2021-10-21 20:08:39,914 INFO L853 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2021-10-21 20:08:39,915 INFO L857 garLoopResultBuilder]: For program point L62-1(lines 35 132) no Hoare annotation was computed. [2021-10-21 20:08:39,916 INFO L857 garLoopResultBuilder]: For program point L112-1(lines 35 132) no Hoare annotation was computed. [2021-10-21 20:08:39,916 INFO L857 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2021-10-21 20:08:39,916 INFO L857 garLoopResultBuilder]: For program point L97-1(lines 35 132) no Hoare annotation was computed. [2021-10-21 20:08:39,916 INFO L857 garLoopResultBuilder]: For program point L122-1(lines 35 132) no Hoare annotation was computed. [2021-10-21 20:08:39,916 INFO L857 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2021-10-21 20:08:39,917 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-21 20:08:39,917 INFO L857 garLoopResultBuilder]: For program point L123(line 123) no Hoare annotation was computed. [2021-10-21 20:08:39,917 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) no Hoare annotation was computed. [2021-10-21 20:08:39,917 INFO L857 garLoopResultBuilder]: For program point L82-1(lines 35 132) no Hoare annotation was computed. [2021-10-21 20:08:39,918 INFO L857 garLoopResultBuilder]: For program point L107-1(lines 35 132) no Hoare annotation was computed. [2021-10-21 20:08:39,918 INFO L857 garLoopResultBuilder]: For program point L74-1(lines 35 132) no Hoare annotation was computed. [2021-10-21 20:08:39,918 INFO L857 garLoopResultBuilder]: For program point L66-1(lines 35 132) no Hoare annotation was computed. [2021-10-21 20:08:39,918 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-21 20:08:39,918 INFO L857 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2021-10-21 20:08:39,919 INFO L857 garLoopResultBuilder]: For program point L58-2(lines 35 132) no Hoare annotation was computed. [2021-10-21 20:08:39,919 INFO L857 garLoopResultBuilder]: For program point L108(line 108) no Hoare annotation was computed. [2021-10-21 20:08:39,919 INFO L860 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2021-10-21 20:08:39,919 INFO L857 garLoopResultBuilder]: For program point L92-1(lines 35 132) no Hoare annotation was computed. [2021-10-21 20:08:39,919 INFO L857 garLoopResultBuilder]: For program point L117-1(lines 35 132) no Hoare annotation was computed. [2021-10-21 20:08:39,925 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 20:08:39,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 08:08:39 BoogieIcfgContainer [2021-10-21 20:08:39,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 20:08:39,938 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 20:08:39,938 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 20:08:39,938 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 20:08:39,939 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:08:34" (3/4) ... [2021-10-21 20:08:39,942 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-21 20:08:39,961 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-21 20:08:39,962 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-21 20:08:39,962 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-21 20:08:39,963 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-21 20:08:40,036 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 20:08:40,037 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 20:08:40,040 INFO L168 Benchmark]: Toolchain (without parser) took 6198.70 ms. Allocated memory was 107.0 MB in the beginning and 174.1 MB in the end (delta: 67.1 MB). Free memory was 66.4 MB in the beginning and 78.8 MB in the end (delta: -12.4 MB). Peak memory consumption was 54.3 MB. Max. memory is 16.1 GB. [2021-10-21 20:08:40,041 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 107.0 MB. Free memory is still 82.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 20:08:40,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 457.21 ms. Allocated memory is still 107.0 MB. Free memory was 66.2 MB in the beginning and 81.7 MB in the end (delta: -15.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-21 20:08:40,042 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.71 ms. Allocated memory is still 107.0 MB. Free memory was 81.7 MB in the beginning and 79.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:08:40,043 INFO L168 Benchmark]: Boogie Preprocessor took 57.54 ms. Allocated memory is still 107.0 MB. Free memory was 79.8 MB in the beginning and 78.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:08:40,044 INFO L168 Benchmark]: RCFGBuilder took 490.10 ms. Allocated memory is still 107.0 MB. Free memory was 78.6 MB in the beginning and 67.2 MB in the end (delta: 11.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-21 20:08:40,044 INFO L168 Benchmark]: TraceAbstraction took 5008.73 ms. Allocated memory was 107.0 MB in the beginning and 174.1 MB in the end (delta: 67.1 MB). Free memory was 66.5 MB in the beginning and 81.9 MB in the end (delta: -15.4 MB). Peak memory consumption was 52.2 MB. Max. memory is 16.1 GB. [2021-10-21 20:08:40,045 INFO L168 Benchmark]: Witness Printer took 99.73 ms. Allocated memory is still 174.1 MB. Free memory was 81.9 MB in the beginning and 78.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-21 20:08:40,047 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 107.0 MB. Free memory is still 82.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 457.21 ms. Allocated memory is still 107.0 MB. Free memory was 66.2 MB in the beginning and 81.7 MB in the end (delta: -15.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 72.71 ms. Allocated memory is still 107.0 MB. Free memory was 81.7 MB in the beginning and 79.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 57.54 ms. Allocated memory is still 107.0 MB. Free memory was 79.8 MB in the beginning and 78.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 490.10 ms. Allocated memory is still 107.0 MB. Free memory was 78.6 MB in the beginning and 67.2 MB in the end (delta: 11.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5008.73 ms. Allocated memory was 107.0 MB in the beginning and 174.1 MB in the end (delta: 67.1 MB). Free memory was 66.5 MB in the beginning and 81.9 MB in the end (delta: -15.4 MB). Peak memory consumption was 52.2 MB. Max. memory is 16.1 GB. * Witness Printer took 99.73 ms. Allocated memory is still 174.1 MB. Free memory was 81.9 MB in the beginning and 78.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 135]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4919.0ms, OverallIterations: 22, TraceHistogramMax: 1, EmptinessCheckTime: 90.3ms, AutomataDifference: 1564.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 26.0ms, InitialAbstractionConstructionTime: 14.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1474 SDtfs, 720 SDslu, 964 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 253.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 86.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4613occurred in iteration=21, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1360.3ms AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 265 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 12.3ms HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 3.1ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 82.6ms SsaConstructionTime, 373.4ms SatisfiabilityAnalysisTime, 933.4ms InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 389 ConstructedInterpolants, 0 QuantifiedInterpolants, 805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-10-21 20:08:40,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13f31f2e-c078-47f4-a7f9-0fb598063164/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...