./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:50:42,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:50:42,339 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:50:42,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:50:42,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:50:42,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:50:42,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:50:42,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:50:42,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:50:42,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:50:42,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:50:42,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:50:42,395 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:50:42,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:50:42,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:50:42,397 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:50:42,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:50:42,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:50:42,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:50:42,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:50:42,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:50:42,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:50:42,404 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:50:42,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:50:42,405 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:50:42,406 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:50:42,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:50:42,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:50:42,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:50:42,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:50:42,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:50:42,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:50:42,410 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:50:42,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:50:42,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:50:42,411 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:50:42,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:50:42,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:50:42,411 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:50:42,412 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 [2023-11-19 07:50:42,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:50:42,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:50:42,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:50:42,737 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:50:42,737 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:50:42,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2023-11-19 07:50:45,835 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:50:46,173 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:50:46,174 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2023-11-19 07:50:46,195 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/data/0dcc0be68/43c4d8fc8c1b40dcb7d28dbf6f4eb354/FLAG91a126106 [2023-11-19 07:50:46,213 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/data/0dcc0be68/43c4d8fc8c1b40dcb7d28dbf6f4eb354 [2023-11-19 07:50:46,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:50:46,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:50:46,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:50:46,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:50:46,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:50:46,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:50:46" (1/1) ... [2023-11-19 07:50:46,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@682d0359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:46, skipping insertion in model container [2023-11-19 07:50:46,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:50:46" (1/1) ... [2023-11-19 07:50:46,302 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:50:46,664 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i[24989,25002] [2023-11-19 07:50:46,671 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:50:46,680 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:50:46,722 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i[24989,25002] [2023-11-19 07:50:46,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:50:46,757 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:50:46,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:46 WrapperNode [2023-11-19 07:50:46,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:50:46,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:50:46,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:50:46,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:50:46,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:46" (1/1) ... [2023-11-19 07:50:46,793 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:46" (1/1) ... [2023-11-19 07:50:46,825 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 168 [2023-11-19 07:50:46,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:50:46,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:50:46,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:50:46,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:50:46,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:46" (1/1) ... [2023-11-19 07:50:46,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:46" (1/1) ... [2023-11-19 07:50:46,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:46" (1/1) ... [2023-11-19 07:50:46,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:46" (1/1) ... [2023-11-19 07:50:46,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:46" (1/1) ... [2023-11-19 07:50:46,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:46" (1/1) ... [2023-11-19 07:50:46,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:46" (1/1) ... [2023-11-19 07:50:46,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:46" (1/1) ... [2023-11-19 07:50:46,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:50:46,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:50:46,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:50:46,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:50:46,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:46" (1/1) ... [2023-11-19 07:50:46,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:50:46,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:46,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:46,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:50:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-19 07:50:46,952 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-19 07:50:46,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:50:46,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:50:46,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 07:50:46,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:50:46,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:50:46,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 07:50:46,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 07:50:46,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:50:46,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 07:50:46,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:50:46,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:50:46,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:50:47,136 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:50:47,138 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:50:47,169 INFO L767 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-19 07:50:47,434 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:50:47,441 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:50:47,447 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-19 07:50:47,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:50:47 BoogieIcfgContainer [2023-11-19 07:50:47,458 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:50:47,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:50:47,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:50:47,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:50:47,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:50:46" (1/3) ... [2023-11-19 07:50:47,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dee58be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:50:47, skipping insertion in model container [2023-11-19 07:50:47,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:46" (2/3) ... [2023-11-19 07:50:47,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dee58be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:50:47, skipping insertion in model container [2023-11-19 07:50:47,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:50:47" (3/3) ... [2023-11-19 07:50:47,473 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2023-11-19 07:50:47,489 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:50:47,489 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:50:47,535 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:50:47,541 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4e5ad398, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:50:47,541 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:50:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 32 states have (on average 1.65625) internal successors, (53), 34 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:50:47,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 07:50:47,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:50:47,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:50:47,553 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:50:47,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:47,559 INFO L85 PathProgramCache]: Analyzing trace with hash -504255867, now seen corresponding path program 1 times [2023-11-19 07:50:47,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:47,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263462486] [2023-11-19 07:50:47,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:47,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:50:47,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:47,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263462486] [2023-11-19 07:50:47,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263462486] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:50:47,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:50:47,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:50:47,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408347164] [2023-11-19 07:50:47,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:50:47,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:50:47,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:50:47,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:50:47,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:50:47,832 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.65625) internal successors, (53), 34 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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) [2023-11-19 07:50:47,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:50:47,855 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2023-11-19 07:50:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:50:47,857 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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 [2023-11-19 07:50:47,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:50:47,862 INFO L225 Difference]: With dead ends: 64 [2023-11-19 07:50:47,862 INFO L226 Difference]: Without dead ends: 27 [2023-11-19 07:50:47,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:50:47,869 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:50:47,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:50:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-19 07:50:47,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-19 07:50:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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) [2023-11-19 07:50:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2023-11-19 07:50:47,898 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 15 [2023-11-19 07:50:47,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:50:47,898 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2023-11-19 07:50:47,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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) [2023-11-19 07:50:47,899 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2023-11-19 07:50:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 07:50:47,900 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:50:47,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:50:47,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:50:47,900 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:50:47,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:47,901 INFO L85 PathProgramCache]: Analyzing trace with hash 775433970, now seen corresponding path program 1 times [2023-11-19 07:50:47,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:47,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034607201] [2023-11-19 07:50:47,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:47,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:50:48,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:48,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034607201] [2023-11-19 07:50:48,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034607201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:50:48,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:50:48,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:50:48,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708833032] [2023-11-19 07:50:48,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:50:48,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:50:48,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:50:48,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:50:48,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:50:48,184 INFO L87 Difference]: Start difference. First operand 27 states and 37 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) [2023-11-19 07:50:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:50:48,218 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2023-11-19 07:50:48,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:50:48,219 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 [2023-11-19 07:50:48,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:50:48,220 INFO L225 Difference]: With dead ends: 52 [2023-11-19 07:50:48,220 INFO L226 Difference]: Without dead ends: 32 [2023-11-19 07:50:48,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:50:48,228 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:50:48,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 67 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:50:48,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-19 07:50:48,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-11-19 07:50:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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) [2023-11-19 07:50:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-11-19 07:50:48,244 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2023-11-19 07:50:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:50:48,244 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-11-19 07:50:48,244 INFO L496 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) [2023-11-19 07:50:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-11-19 07:50:48,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 07:50:48,246 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:50:48,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:50:48,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:50:48,247 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:50:48,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:48,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1038406110, now seen corresponding path program 1 times [2023-11-19 07:50:48,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:48,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062868737] [2023-11-19 07:50:48,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:48,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:50:48,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:48,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062868737] [2023-11-19 07:50:48,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062868737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:50:48,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:50:48,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:50:48,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356968072] [2023-11-19 07:50:48,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:50:48,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:50:48,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:50:48,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:50:48,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:50:48,465 INFO L87 Difference]: Start difference. First operand 28 states and 38 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) [2023-11-19 07:50:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:50:48,497 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2023-11-19 07:50:48,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:50:48,499 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 [2023-11-19 07:50:48,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:50:48,505 INFO L225 Difference]: With dead ends: 57 [2023-11-19 07:50:48,506 INFO L226 Difference]: Without dead ends: 32 [2023-11-19 07:50:48,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:50:48,511 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:50:48,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:50:48,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-19 07:50:48,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-11-19 07:50:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 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) [2023-11-19 07:50:48,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2023-11-19 07:50:48,517 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 20 [2023-11-19 07:50:48,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:50:48,517 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2023-11-19 07:50:48,517 INFO L496 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) [2023-11-19 07:50:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2023-11-19 07:50:48,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 07:50:48,518 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:50:48,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:50:48,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:50:48,519 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:50:48,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:48,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1976697508, now seen corresponding path program 1 times [2023-11-19 07:50:48,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:48,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372782564] [2023-11-19 07:50:48,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:48,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:50:48,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:48,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372782564] [2023-11-19 07:50:48,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372782564] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:50:48,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854261349] [2023-11-19 07:50:48,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:48,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:50:48,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:48,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:50:48,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:50:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:48,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 07:50:48,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:50:48,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:50:48,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:50:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:50:49,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854261349] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:50:49,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:50:49,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-19 07:50:49,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991856781] [2023-11-19 07:50:49,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:50:49,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:50:49,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:50:49,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:50:49,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:50:49,024 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) [2023-11-19 07:50:49,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:50:49,068 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2023-11-19 07:50:49,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:50:49,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 [2023-11-19 07:50:49,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:50:49,070 INFO L225 Difference]: With dead ends: 53 [2023-11-19 07:50:49,071 INFO L226 Difference]: Without dead ends: 33 [2023-11-19 07:50:49,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:50:49,078 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:50:49,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 127 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:50:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-19 07:50:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-19 07:50:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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) [2023-11-19 07:50:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2023-11-19 07:50:49,092 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 20 [2023-11-19 07:50:49,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:50:49,092 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2023-11-19 07:50:49,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) [2023-11-19 07:50:49,093 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2023-11-19 07:50:49,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-19 07:50:49,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:50:49,097 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:50:49,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:49,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:50:49,312 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:50:49,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:49,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1871980112, now seen corresponding path program 1 times [2023-11-19 07:50:49,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:49,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689686394] [2023-11-19 07:50:49,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:49,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 07:50:49,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:49,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689686394] [2023-11-19 07:50:49,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689686394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:50:49,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:50:49,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:50:49,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42798587] [2023-11-19 07:50:49,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:50:49,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:50:49,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:50:49,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:50:49,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:50:49,456 INFO L87 Difference]: Start difference. First operand 33 states and 43 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) [2023-11-19 07:50:49,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:50:49,484 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2023-11-19 07:50:49,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:50:49,487 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 25 [2023-11-19 07:50:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:50:49,489 INFO L225 Difference]: With dead ends: 47 [2023-11-19 07:50:49,489 INFO L226 Difference]: Without dead ends: 36 [2023-11-19 07:50:49,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:50:49,490 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:50:49,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 64 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:50:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-19 07:50:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2023-11-19 07:50:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 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) [2023-11-19 07:50:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-11-19 07:50:49,497 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 25 [2023-11-19 07:50:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:50:49,497 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-11-19 07:50:49,498 INFO L496 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) [2023-11-19 07:50:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-11-19 07:50:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-19 07:50:49,499 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:50:49,499 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:50:49,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:50:49,500 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:50:49,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:49,501 INFO L85 PathProgramCache]: Analyzing trace with hash 835167343, now seen corresponding path program 1 times [2023-11-19 07:50:49,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:49,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778789356] [2023-11-19 07:50:49,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:49,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:50:49,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:49,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778789356] [2023-11-19 07:50:49,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778789356] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:50:49,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820658467] [2023-11-19 07:50:49,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:49,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:50:49,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:49,798 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:50:49,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:50:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:49,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 07:50:50,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:50:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 07:50:50,087 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:50:50,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820658467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:50:50,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:50:50,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-11-19 07:50:50,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916178635] [2023-11-19 07:50:50,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:50:50,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:50:50,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:50:50,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:50:50,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:50:50,090 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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) [2023-11-19 07:50:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:50:50,139 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2023-11-19 07:50:50,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:50:50,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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 26 [2023-11-19 07:50:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:50:50,142 INFO L225 Difference]: With dead ends: 47 [2023-11-19 07:50:50,143 INFO L226 Difference]: Without dead ends: 34 [2023-11-19 07:50:50,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:50:50,145 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 28 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:50:50,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:50:50,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-19 07:50:50,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-19 07:50:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 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) [2023-11-19 07:50:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2023-11-19 07:50:50,154 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 26 [2023-11-19 07:50:50,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:50:50,154 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2023-11-19 07:50:50,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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) [2023-11-19 07:50:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2023-11-19 07:50:50,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-19 07:50:50,156 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:50:50,156 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:50:50,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:50:50,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:50:50,372 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:50:50,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:50,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1615339204, now seen corresponding path program 1 times [2023-11-19 07:50:50,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:50,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875983677] [2023-11-19 07:50:50,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:50,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:50:53,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:53,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875983677] [2023-11-19 07:50:53,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875983677] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:50:53,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412562599] [2023-11-19 07:50:53,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:53,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:50:53,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:53,456 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:50:53,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee9ce92f-66b8-432c-b291-2ad29defb755/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:50:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:54,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-19 07:50:54,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:50:54,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 07:50:54,772 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-19 07:50:54,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-19 07:50:54,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-19 07:50:55,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-19 07:50:55,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-19 07:50:55,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-19 07:50:55,195 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-19 07:50:55,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 64 [2023-11-19 07:50:55,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-19 07:50:55,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-19 07:50:55,739 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-19 07:50:55,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-19 07:50:55,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:50:56,005 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-19 07:50:56,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 68 [2023-11-19 07:50:56,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:50:56,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:50:56,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:50:56,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-11-19 07:50:56,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:50:56,752 INFO L349 Elim1Store]: treesize reduction 52, result has 8.8 percent of original size [2023-11-19 07:50:56,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 158 treesize of output 105 [2023-11-19 07:50:56,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:50:56,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:50:56,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2023-11-19 07:50:56,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-11-19 07:50:56,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-11-19 07:50:56,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:50:56,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:50:56,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2023-11-19 07:50:56,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-19 07:50:56,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:50:56,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 07:50:57,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:50:57,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2023-11-19 07:50:57,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-19 07:50:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:50:57,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:50:57,478 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_677 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_677) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_678) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-11-19 07:50:57,506 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_672 Int) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4) v_ArrVal_672)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_670) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_677) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_675) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_669))) (store .cse0 |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_673) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_674) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_678) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-11-19 07:50:57,553 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_672 Int) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 v_ArrVal_672)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_670) .cse1 v_ArrVal_677) (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_675) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_669))) (store .cse2 .cse1 (store (select .cse2 .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0) 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_673) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_674) .cse1 v_ArrVal_678) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-11-19 07:50:57,573 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_672 Int) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_672)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_670) .cse2 v_ArrVal_677) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_675) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_669))) (store .cse3 .cse2 (store (select .cse3 .cse2) (+ (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) 8) |c_ULTIMATE.start_node_create_#res#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_673) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_674) .cse2 v_ArrVal_678) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-11-19 07:50:57,614 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_678 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_672 Int) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_664 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_667)) (.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_665))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select .cse4 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse2 (select (select .cse5 .cse0) .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_664) .cse0) .cse1 v_ArrVal_672)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_670) .cse2 v_ArrVal_677) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_675) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_669))) (store .cse3 .cse2 (store (select .cse3 .cse2) (+ (select (select .cse4 .cse0) .cse1) 8) |c_ULTIMATE.start_node_create_~temp~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_673) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_674) .cse2 v_ArrVal_678) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-11-19 07:50:58,485 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_10| Int) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_660 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_664 (Array Int Int)) (v_ArrVal_675 (Array Int Int)) (v_ArrVal_667 (Array Int Int)) (v_ArrVal_678 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_672 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_661)) (.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_662))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store .cse0 |v_ULTIMATE.start_node_create_~temp~0#1.base_10| v_ArrVal_667)) (.cse8 (store .cse7 |v_ULTIMATE.start_node_create_~temp~0#1.base_10| v_ArrVal_665))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 4 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse4 (select (select .cse8 .cse2) .cse3))) (select (select (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_660))) (store .cse1 .cse2 (store (select (store .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_10| v_ArrVal_664) .cse2) .cse3 v_ArrVal_672))) |v_ULTIMATE.start_node_create_~temp~0#1.base_10| v_ArrVal_670) .cse4 v_ArrVal_677) (select (select (let ((.cse5 (store (store .cse7 .cse2 v_ArrVal_675) |v_ULTIMATE.start_node_create_~temp~0#1.base_10| v_ArrVal_669))) (store .cse5 .cse4 (store (select .cse5 .cse4) (+ 8 (select (select .cse6 .cse2) .cse3)) |v_ULTIMATE.start_node_create_~temp~0#1.base_10|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store (store .cse0 .cse2 v_ArrVal_673) |v_ULTIMATE.start_node_create_~temp~0#1.base_10| v_ArrVal_674) .cse4 v_ArrVal_678) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_10| 1)) (not (= (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_10|) 0))))) is different from false [2023-11-19 07:50:58,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:50:58,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 693 treesize of output 458 [2023-11-19 07:50:58,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:50:58,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89304 treesize of output 88730 [2023-11-19 07:50:58,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:50:58,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21846 treesize of output 15491 [2023-11-19 07:51:35,471 WARN L293 SmtUtils]: Spent 30.20s on a formula simplification. DAG size of input: 215 DAG size of output: 183 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-19 07:51:35,471 INFO L349 Elim1Store]: treesize reduction 96, result has 85.2 percent of original size [2023-11-19 07:51:35,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 14 new quantified variables, introduced 45 case distinctions, treesize of input 793819475 treesize of output 743361249