./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.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_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/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_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/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_bd3981f2-870e-440f-8961-ec984ba7583d/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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:49:47,144 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:49:47,220 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-11-19 07:49:47,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:49:47,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:49:47,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:49:47,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:49:47,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:49:47,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:49:47,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:49:47,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:49:47,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 07:49:47,295 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 07:49:47,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:49:47,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-19 07:49:47,298 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 07:49:47,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 07:49:47,299 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 07:49:47,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 07:49:47,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-19 07:49:47,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:49:47,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-19 07:49:47,301 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 07:49:47,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-19 07:49:47,302 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 07:49:47,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:49:47,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 07:49:47,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 07:49:47,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:49:47,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:49:47,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:49:47,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-19 07:49:47,306 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-19 07:49:47,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-19 07:49:47,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:49:47,307 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-19 07:49:47,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:49:47,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:49:47,308 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:49:47,308 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_bd3981f2-870e-440f-8961-ec984ba7583d/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_bd3981f2-870e-440f-8961-ec984ba7583d/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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a
[2023-11-19 07:49:47,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:49:47,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:49:47,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:49:47,662 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 07:49:47,663 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 07:49:47,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i
[2023-11-19 07:49:50,905 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 07:49:51,301 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 07:49:51,302 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i
[2023-11-19 07:49:51,317 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/data/667218db6/09d63b8f4b5949fa8d8907c5c154c5c7/FLAG35fb92f96
[2023-11-19 07:49:51,479 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/data/667218db6/09d63b8f4b5949fa8d8907c5c154c5c7
[2023-11-19 07:49:51,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 07:49:51,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 07:49:51,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 07:49:51,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 07:49:51,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 07:49:51,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:49:51" (1/1) ...
[2023-11-19 07:49:51,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21478d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:51, skipping insertion in model container
[2023-11-19 07:49:51,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:49:51" (1/1) ...
[2023-11-19 07:49:51,536 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 07:49:51,863 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_bd3981f2-870e-440f-8961-ec984ba7583d/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449]
[2023-11-19 07:49:51,875 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:49:51,888 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 07:49:51,971 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_bd3981f2-870e-440f-8961-ec984ba7583d/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449]
[2023-11-19 07:49:51,976 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:49:52,015 INFO L206 MainTranslator]: Completed translation
[2023-11-19 07:49:52,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:52 WrapperNode
[2023-11-19 07:49:52,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 07:49:52,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 07:49:52,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 07:49:52,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 07:49:52,027 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:49:52" (1/1) ...
[2023-11-19 07:49:52,062 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:49:52" (1/1) ...
[2023-11-19 07:49:52,097 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131
[2023-11-19 07:49:52,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 07:49:52,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 07:49:52,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 07:49:52,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 07:49:52,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:52" (1/1) ...
[2023-11-19 07:49:52,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:52" (1/1) ...
[2023-11-19 07:49:52,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:52" (1/1) ...
[2023-11-19 07:49:52,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:52" (1/1) ...
[2023-11-19 07:49:52,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:52" (1/1) ...
[2023-11-19 07:49:52,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:52" (1/1) ...
[2023-11-19 07:49:52,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:52" (1/1) ...
[2023-11-19 07:49:52,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:52" (1/1) ...
[2023-11-19 07:49:52,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 07:49:52,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 07:49:52,170 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 07:49:52,170 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 07:49:52,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:52" (1/1) ...
[2023-11-19 07:49:52,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:49:52,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:49:52,208 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/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:49:52,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/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:49:52,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2023-11-19 07:49:52,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-11-19 07:49:52,251 INFO L130 BoogieDeclarations]: Found specification of procedure node_create
[2023-11-19 07:49:52,251 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create
[2023-11-19 07:49:52,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-19 07:49:52,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 07:49:52,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2023-11-19 07:49:52,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-19 07:49:52,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-19 07:49:52,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 07:49:52,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 07:49:52,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 07:49:52,375 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 07:49:52,378 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 07:49:52,613 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 07:49:52,622 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 07:49:52,622 INFO L302 CfgBuilder]: Removed 6 assume(true) statements.
[2023-11-19 07:49:52,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:49:52 BoogieIcfgContainer
[2023-11-19 07:49:52,626 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 07:49:52,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 07:49:52,630 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 07:49:52,640 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 07:49:52,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:49:51" (1/3) ...
[2023-11-19 07:49:52,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fe3c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:49:52, skipping insertion in model container
[2023-11-19 07:49:52,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:49:52" (2/3) ...
[2023-11-19 07:49:52,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fe3c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:49:52, skipping insertion in model container
[2023-11-19 07:49:52,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:49:52" (3/3) ...
[2023-11-19 07:49:52,647 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i
[2023-11-19 07:49:52,667 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 07:49:52,668 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-11-19 07:49:52,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:49:52,736 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;@25cfae21, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:49:52,737 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-11-19 07:49:52,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2023-11-19 07:49:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2023-11-19 07:49:52,758 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:49:52,759 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:49:52,760 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:49:52,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:49:52,768 INFO L85 PathProgramCache]: Analyzing trace with hash 663980757, now seen corresponding path program 1 times
[2023-11-19 07:49:52,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:49:52,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503724328]
[2023-11-19 07:49:52,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:49:52,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:49:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:53,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-19 07:49:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:53,114 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:49:53,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:49:53,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503724328]
[2023-11-19 07:49:53,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503724328] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:49:53,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:49:53,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:49:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99006745]
[2023-11-19 07:49:53,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:49:53,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:49:53,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:49:53,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:49:53,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:49:53,160 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2023-11-19 07:49:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:49:53,249 INFO L93 Difference]: Finished difference Result 61 states and 87 transitions.
[2023-11-19 07:49:53,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:49:53,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20
[2023-11-19 07:49:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:49:53,260 INFO L225 Difference]: With dead ends: 61
[2023-11-19 07:49:53,261 INFO L226 Difference]: Without dead ends: 28
[2023-11-19 07:49:53,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:49:53,293 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 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.1s IncrementalHoareTripleChecker+Time
[2023-11-19 07:49:53,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-11-19 07:49:53,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2023-11-19 07:49:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2023-11-19 07:49:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2023-11-19 07:49:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions.
[2023-11-19 07:49:53,378 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 20
[2023-11-19 07:49:53,380 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:49:53,380 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions.
[2023-11-19 07:49:53,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2023-11-19 07:49:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions.
[2023-11-19 07:49:53,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2023-11-19 07:49:53,382 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:49:53,383 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:49:53,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-19 07:49:53,383 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:49:53,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:49:53,384 INFO L85 PathProgramCache]: Analyzing trace with hash 616475652, now seen corresponding path program 1 times
[2023-11-19 07:49:53,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:49:53,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658225022]
[2023-11-19 07:49:53,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:49:53,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:49:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:53,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-19 07:49:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:53,721 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:49:53,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:49:53,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658225022]
[2023-11-19 07:49:53,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658225022] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:49:53,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:49:53,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:49:53,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762801550]
[2023-11-19 07:49:53,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:49:53,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:49:53,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:49:53,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:49:53,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:49:53,736 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2023-11-19 07:49:53,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:49:53,787 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions.
[2023-11-19 07:49:53,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:49:53,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20
[2023-11-19 07:49:53,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:49:53,790 INFO L225 Difference]: With dead ends: 47
[2023-11-19 07:49:53,790 INFO L226 Difference]: Without dead ends: 31
[2023-11-19 07:49:53,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:49:53,800 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:49:53,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 76 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:49:53,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2023-11-19 07:49:53,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29.
[2023-11-19 07:49:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2023-11-19 07:49:53,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions.
[2023-11-19 07:49:53,816 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 20
[2023-11-19 07:49:53,817 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:49:53,817 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions.
[2023-11-19 07:49:53,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2023-11-19 07:49:53,817 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions.
[2023-11-19 07:49:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2023-11-19 07:49:53,820 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:49:53,820 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, 1, 1]
[2023-11-19 07:49:53,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-19 07:49:53,821 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:49:53,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:49:53,824 INFO L85 PathProgramCache]: Analyzing trace with hash -600691076, now seen corresponding path program 1 times
[2023-11-19 07:49:53,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:49:53,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12261785]
[2023-11-19 07:49:53,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:49:53,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:49:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:54,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-19 07:49:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:54,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:49:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2023-11-19 07:49:54,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:49:54,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12261785]
[2023-11-19 07:49:54,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12261785] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:49:54,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221083846]
[2023-11-19 07:49:54,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:49:54,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:49:54,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:49:54,345 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 07:49:54,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-19 07:49:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:54,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjunts are in the unsatisfiable core
[2023-11-19 07:49:54,537 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:49:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2023-11-19 07:49:54,614 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-19 07:49:54,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221083846] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:49:54,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-19 07:49:54,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6
[2023-11-19 07:49:54,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386012380]
[2023-11-19 07:49:54,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:49:54,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:49:54,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:49:54,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:49:54,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:49:54,630 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2023-11-19 07:49:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:49:54,681 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions.
[2023-11-19 07:49:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:49:54,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28
[2023-11-19 07:49:54,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:49:54,686 INFO L225 Difference]: With dead ends: 51
[2023-11-19 07:49:54,686 INFO L226 Difference]: Without dead ends: 42
[2023-11-19 07:49:54,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:49:54,691 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 46 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:49:54,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 59 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:49:54,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2023-11-19 07:49:54,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30.
[2023-11-19 07:49:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2023-11-19 07:49:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions.
[2023-11-19 07:49:54,710 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 28
[2023-11-19 07:49:54,710 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:49:54,711 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions.
[2023-11-19 07:49:54,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2023-11-19 07:49:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions.
[2023-11-19 07:49:54,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2023-11-19 07:49:54,713 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:49:54,713 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, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:49:54,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-11-19 07:49:54,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2023-11-19 07:49:54,937 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:49:54,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:49:54,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1948852891, now seen corresponding path program 1 times
[2023-11-19 07:49:54,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:49:54,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925297108]
[2023-11-19 07:49:54,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:49:54,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:49:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:55,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-19 07:49:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:55,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:49:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2023-11-19 07:49:55,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:49:55,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925297108]
[2023-11-19 07:49:55,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925297108] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:49:55,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252080664]
[2023-11-19 07:49:55,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:49:55,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:49:55,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:49:55,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 07:49:55,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-11-19 07:49:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:55,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-11-19 07:49:55,378 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:49:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2023-11-19 07:49:55,412 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-19 07:49:55,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252080664] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:49:55,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-19 07:49:55,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8
[2023-11-19 07:49:55,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90095202]
[2023-11-19 07:49:55,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:49:55,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:49:55,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:49:55,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:49:55,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2023-11-19 07:49:55,415 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2023-11-19 07:49:55,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:49:55,463 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions.
[2023-11-19 07:49:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:49:55,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33
[2023-11-19 07:49:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:49:55,465 INFO L225 Difference]: With dead ends: 57
[2023-11-19 07:49:55,465 INFO L226 Difference]: Without dead ends: 43
[2023-11-19 07:49:55,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2023-11-19 07:49:55,468 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 48 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:49:55,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 82 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:49:55,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2023-11-19 07:49:55,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31.
[2023-11-19 07:49:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2023-11-19 07:49:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions.
[2023-11-19 07:49:55,484 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 33
[2023-11-19 07:49:55,485 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:49:55,485 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions.
[2023-11-19 07:49:55,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2023-11-19 07:49:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions.
[2023-11-19 07:49:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2023-11-19 07:49:55,486 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:49:55,487 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:49:55,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-11-19 07:49:55,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:49:55,708 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:49:55,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:49:55,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2082169171, now seen corresponding path program 1 times
[2023-11-19 07:49:55,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:49:55,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806514674]
[2023-11-19 07:49:55,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:49:55,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:49:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:55,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-19 07:49:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:55,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:49:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2023-11-19 07:49:55,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:49:55,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806514674]
[2023-11-19 07:49:55,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806514674] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:49:55,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625521800]
[2023-11-19 07:49:55,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:49:55,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:49:55,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:49:55,938 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 07:49:55,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-11-19 07:49:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:56,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-19 07:49:56,088 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:49:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-11-19 07:49:56,118 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-19 07:49:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-11-19 07:49:56,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625521800] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-19 07:49:56,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-19 07:49:56,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7
[2023-11-19 07:49:56,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126873154]
[2023-11-19 07:49:56,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-19 07:49:56,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:49:56,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:49:56,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:49:56,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:49:56,179 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2023-11-19 07:49:56,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:49:56,283 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions.
[2023-11-19 07:49:56,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 07:49:56,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34
[2023-11-19 07:49:56,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:49:56,285 INFO L225 Difference]: With dead ends: 56
[2023-11-19 07:49:56,285 INFO L226 Difference]: Without dead ends: 47
[2023-11-19 07:49:56,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2023-11-19 07:49:56,286 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 56 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-11-19 07:49:56,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 97 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-11-19 07:49:56,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2023-11-19 07:49:56,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36.
[2023-11-19 07:49:56,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2023-11-19 07:49:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions.
[2023-11-19 07:49:56,294 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 34
[2023-11-19 07:49:56,294 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:49:56,294 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions.
[2023-11-19 07:49:56,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2023-11-19 07:49:56,295 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions.
[2023-11-19 07:49:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2023-11-19 07:49:56,296 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:49:56,296 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:49:56,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-11-19 07:49:56,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:49:56,513 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:49:56,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:49:56,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1439163348, now seen corresponding path program 2 times
[2023-11-19 07:49:56,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:49:56,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439591008]
[2023-11-19 07:49:56,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:49:56,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:49:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:56,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-19 07:49:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:56,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:49:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2023-11-19 07:49:56,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:49:56,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439591008]
[2023-11-19 07:49:56,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439591008] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:49:56,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492577329]
[2023-11-19 07:49:56,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-19 07:49:56,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:49:56,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:49:56,778 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 07:49:56,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-11-19 07:49:56,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2023-11-19 07:49:56,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-19 07:49:56,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-11-19 07:49:56,920 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:49:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2023-11-19 07:49:56,965 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-19 07:49:56,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492577329] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:49:56,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-19 07:49:56,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7
[2023-11-19 07:49:56,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739742994]
[2023-11-19 07:49:56,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:49:56,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:49:56,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:49:56,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:49:56,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:49:56,968 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2023-11-19 07:49:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:49:57,019 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions.
[2023-11-19 07:49:57,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:49:57,019 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39
[2023-11-19 07:49:57,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:49:57,024 INFO L225 Difference]: With dead ends: 53
[2023-11-19 07:49:57,024 INFO L226 Difference]: Without dead ends: 45
[2023-11-19 07:49:57,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2023-11-19 07:49:57,026 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 34 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:49:57,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 82 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:49:57,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2023-11-19 07:49:57,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38.
[2023-11-19 07:49:57,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2023-11-19 07:49:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions.
[2023-11-19 07:49:57,043 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 39
[2023-11-19 07:49:57,043 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:49:57,044 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions.
[2023-11-19 07:49:57,044 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2023-11-19 07:49:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions.
[2023-11-19 07:49:57,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2023-11-19 07:49:57,053 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:49:57,053 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:49:57,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-11-19 07:49:57,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:49:57,267 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:49:57,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:49:57,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1716044715, now seen corresponding path program 1 times
[2023-11-19 07:49:57,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:49:57,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004392432]
[2023-11-19 07:49:57,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:49:57,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:49:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:59,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-19 07:49:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:59,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:49:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:49:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-19 07:49:59,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:49:59,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004392432]
[2023-11-19 07:49:59,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004392432] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:49:59,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233172680]
[2023-11-19 07:49:59,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:49:59,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:49:59,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:49:59,993 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 07:50:00,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-11-19 07:50:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:00,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 116 conjunts are in the unsatisfiable core
[2023-11-19 07:50:00,188 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:50:00,254 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:00,487 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-19 07:50:00,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-11-19 07:50:00,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-19 07:50:00,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-19 07:50:00,696 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size
[2023-11-19 07:50:00,697 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 44 treesize of output 30
[2023-11-19 07:50:00,708 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:01,101 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size
[2023-11-19 07:50:01,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 58
[2023-11-19 07:50:01,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2023-11-19 07:50:01,117 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:01,124 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 5 treesize of output 3
[2023-11-19 07:50:01,348 INFO L190 IndexEqualityManager]: detected not equals via solver
[2023-11-19 07:50:01,350 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 39 treesize of output 19
[2023-11-19 07:50:01,356 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 20 treesize of output 15
[2023-11-19 07:50:01,367 INFO L190 IndexEqualityManager]: detected not equals via solver
[2023-11-19 07:50:01,368 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 27 treesize of output 11
[2023-11-19 07:50:01,534 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 27 treesize of output 15
[2023-11-19 07:50:01,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3
[2023-11-19 07:50:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2023-11-19 07:50:01,709 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-19 07:50:01,939 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 Int) (v_ArrVal_623 Int)) (= (+ (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_627) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_626)) |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_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_623)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false
[2023-11-19 07:50:01,997 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| Int) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 Int) (v_ArrVal_623 Int)) (or (= (+ (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_627) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_626) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_623) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false
[2023-11-19 07:50:02,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-19 07:50:02,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51
[2023-11-19 07:50:02,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-19 07:50:02,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103
[2023-11-19 07:50:02,093 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 39 treesize of output 23
[2023-11-19 07:50:02,634 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_626 Int) (v_ArrVal_620 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_620) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| 4) v_ArrVal_626) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| Int)) (or (forall ((v_ArrVal_621 (Array Int Int)) (v_ArrVal_623 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_621) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| 4) v_ArrVal_623) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| Int)) (or (forall ((v_ArrVal_626 Int) (v_ArrVal_620 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_620) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| 4) v_ArrVal_626) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false
[2023-11-19 07:50:02,692 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| Int)) (or (forall ((v_ArrVal_621 (Array Int Int)) (v_ArrVal_623 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_621) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| 4) v_ArrVal_623) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| Int)) (or (forall ((v_ArrVal_626 Int) (v_ArrVal_620 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_620) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| 4) v_ArrVal_626) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_main_~len~0#1| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_626 Int) (v_ArrVal_620 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_620) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| 4) v_ArrVal_626) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))))) is different from false
[2023-11-19 07:50:03,073 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| Int) (v_ArrVal_618 (Array Int Int))) (or (forall ((v_ArrVal_621 (Array Int Int)) (v_ArrVal_623 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_618))) (= (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (select (store (select (store .cse0 .cse1 v_ArrVal_621) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| 4) v_ArrVal_623) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| Int)) (or (forall ((v_ArrVal_626 Int) (v_ArrVal_620 (Array Int Int))) (= .cse1 (select (store (select (store .cse2 .cse1 v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| 4) v_ArrVal_626) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_626 Int) (v_ArrVal_620 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store .cse2 .cse1 v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| 4) v_ArrVal_626) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))))) is different from false
[2023-11-19 07:50:03,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-19 07:50:03,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62
[2023-11-19 07:50:03,145 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 428 treesize of output 400
[2023-11-19 07:50:03,174 INFO L173 IndexEqualityManager]: detected equality via solver
[2023-11-19 07:50:03,177 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 93 treesize of output 87
[2023-11-19 07:50:03,182 INFO L173 IndexEqualityManager]: detected equality via solver
[2023-11-19 07:50:03,184 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 74 treesize of output 70
[2023-11-19 07:50:03,191 INFO L173 IndexEqualityManager]: detected equality via solver
[2023-11-19 07:50:03,194 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 49 treesize of output 45
[2023-11-19 07:50:03,228 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size
[2023-11-19 07:50:03,228 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 69 treesize of output 1
[2023-11-19 07:50:03,241 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size
[2023-11-19 07:50:03,242 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 67 treesize of output 1
[2023-11-19 07:50:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked.
[2023-11-19 07:50:03,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233172680] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-19 07:50:03,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-19 07:50:03,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 60
[2023-11-19 07:50:03,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620960554]
[2023-11-19 07:50:03,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-19 07:50:03,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states
[2023-11-19 07:50:03,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:50:03,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants.
[2023-11-19 07:50:03,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2782, Unknown=21, NotChecked=550, Total=3540
[2023-11-19 07:50:03,860 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 60 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 51 states have internal predecessors, (94), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2023-11-19 07:50:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:50:07,017 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions.
[2023-11-19 07:50:07,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2023-11-19 07:50:07,018 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 51 states have internal predecessors, (94), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40
[2023-11-19 07:50:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:50:07,022 INFO L225 Difference]: With dead ends: 86
[2023-11-19 07:50:07,022 INFO L226 Difference]: Without dead ends: 84
[2023-11-19 07:50:07,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=436, Invalid=4965, Unknown=21, NotChecked=740, Total=6162
[2023-11-19 07:50:07,027 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 247 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 420 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2023-11-19 07:50:07,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 610 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1148 Invalid, 0 Unknown, 420 Unchecked, 1.1s Time]
[2023-11-19 07:50:07,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2023-11-19 07:50:07,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62.
[2023-11-19 07:50:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 57 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2023-11-19 07:50:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions.
[2023-11-19 07:50:07,042 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 40
[2023-11-19 07:50:07,043 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:50:07,043 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions.
[2023-11-19 07:50:07,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 51 states have internal predecessors, (94), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2023-11-19 07:50:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions.
[2023-11-19 07:50:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2023-11-19 07:50:07,044 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:50:07,045 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:50:07,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2023-11-19 07:50:07,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:50:07,269 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:50:07,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:50:07,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1709432500, now seen corresponding path program 2 times
[2023-11-19 07:50:07,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:50:07,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497877571]
[2023-11-19 07:50:07,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:50:07,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:50:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:07,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-19 07:50:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:07,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:50:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:07,454 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2023-11-19 07:50:07,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:50:07,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497877571]
[2023-11-19 07:50:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497877571] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:50:07,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713332230]
[2023-11-19 07:50:07,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-19 07:50:07,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:50:07,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:50:07,457 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 07:50:07,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-11-19 07:50:07,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-19 07:50:07,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-19 07:50:07,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-11-19 07:50:07,628 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:50:07,673 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2023-11-19 07:50:07,674 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-19 07:50:07,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713332230] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:50:07,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-19 07:50:07,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8
[2023-11-19 07:50:07,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291056752]
[2023-11-19 07:50:07,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:50:07,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:50:07,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:50:07,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:50:07,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2023-11-19 07:50:07,676 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2023-11-19 07:50:07,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:50:07,733 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions.
[2023-11-19 07:50:07,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 07:50:07,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41
[2023-11-19 07:50:07,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:50:07,737 INFO L225 Difference]: With dead ends: 71
[2023-11-19 07:50:07,737 INFO L226 Difference]: Without dead ends: 63
[2023-11-19 07:50:07,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2023-11-19 07:50:07,739 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:50:07,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 89 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:50:07,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2023-11-19 07:50:07,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63.
[2023-11-19 07:50:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 58 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2023-11-19 07:50:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions.
[2023-11-19 07:50:07,764 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 41
[2023-11-19 07:50:07,764 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:50:07,764 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions.
[2023-11-19 07:50:07,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2023-11-19 07:50:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions.
[2023-11-19 07:50:07,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2023-11-19 07:50:07,767 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:50:07,767 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:50:07,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2023-11-19 07:50:07,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:50:07,985 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:50:07,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:50:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash 227314337, now seen corresponding path program 3 times
[2023-11-19 07:50:07,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:50:07,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525104351]
[2023-11-19 07:50:07,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:50:07,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:50:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:08,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-19 07:50:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:08,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:50:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-11-19 07:50:08,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:50:08,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525104351]
[2023-11-19 07:50:08,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525104351] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:50:08,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885100970]
[2023-11-19 07:50:08,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-11-19 07:50:08,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:50:08,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:50:08,218 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 07:50:08,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-11-19 07:50:08,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2023-11-19 07:50:08,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-19 07:50:08,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-11-19 07:50:08,871 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:50:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2023-11-19 07:50:08,917 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-19 07:50:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2023-11-19 07:50:08,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885100970] provided 1 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:50:08,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2023-11-19 07:50:08,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 5] total 12
[2023-11-19 07:50:08,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436494920]
[2023-11-19 07:50:08,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:50:08,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:50:08,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:50:08,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:50:08,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2023-11-19 07:50:08,972 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2023-11-19 07:50:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:50:09,029 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions.
[2023-11-19 07:50:09,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:50:09,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41
[2023-11-19 07:50:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:50:09,031 INFO L225 Difference]: With dead ends: 80
[2023-11-19 07:50:09,032 INFO L226 Difference]: Without dead ends: 68
[2023-11-19 07:50:09,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156
[2023-11-19 07:50:09,033 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:50:09,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 75 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:50:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2023-11-19 07:50:09,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63.
[2023-11-19 07:50:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 58 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2023-11-19 07:50:09,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions.
[2023-11-19 07:50:09,049 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 41
[2023-11-19 07:50:09,050 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:50:09,050 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions.
[2023-11-19 07:50:09,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2023-11-19 07:50:09,050 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions.
[2023-11-19 07:50:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2023-11-19 07:50:09,051 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:50:09,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:50:09,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2023-11-19 07:50:09,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8
[2023-11-19 07:50:09,267 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:50:09,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:50:09,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1346076317, now seen corresponding path program 4 times
[2023-11-19 07:50:09,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:50:09,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033974270]
[2023-11-19 07:50:09,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:50:09,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:50:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:09,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-19 07:50:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:09,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:50:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2023-11-19 07:50:09,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:50:09,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033974270]
[2023-11-19 07:50:09,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033974270] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:50:09,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24092233]
[2023-11-19 07:50:09,533 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-11-19 07:50:09,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:50:09,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:50:09,534 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 07:50:09,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-11-19 07:50:09,711 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-11-19 07:50:09,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-19 07:50:09,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-11-19 07:50:09,719 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:50:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2023-11-19 07:50:09,747 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-19 07:50:09,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24092233] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:50:09,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-19 07:50:09,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9
[2023-11-19 07:50:09,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566638223]
[2023-11-19 07:50:09,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:50:09,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:50:09,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:50:09,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:50:09,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2023-11-19 07:50:09,751 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2023-11-19 07:50:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:50:09,811 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions.
[2023-11-19 07:50:09,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 07:50:09,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41
[2023-11-19 07:50:09,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:50:09,813 INFO L225 Difference]: With dead ends: 85
[2023-11-19 07:50:09,813 INFO L226 Difference]: Without dead ends: 63
[2023-11-19 07:50:09,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2023-11-19 07:50:09,815 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 39 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-19 07:50:09,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 67 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-19 07:50:09,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2023-11-19 07:50:09,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63.
[2023-11-19 07:50:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2023-11-19 07:50:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions.
[2023-11-19 07:50:09,832 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 41
[2023-11-19 07:50:09,832 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:50:09,832 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions.
[2023-11-19 07:50:09,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2023-11-19 07:50:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions.
[2023-11-19 07:50:09,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2023-11-19 07:50:09,833 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:50:09,834 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:09,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2023-11-19 07:50:10,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2023-11-19 07:50:10,049 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:50:10,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:50:10,049 INFO L85 PathProgramCache]: Analyzing trace with hash 474143318, now seen corresponding path program 1 times
[2023-11-19 07:50:10,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:50:10,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172817975]
[2023-11-19 07:50:10,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:50:10,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:50:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:11,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-19 07:50:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:11,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:50:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:11,156 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2023-11-19 07:50:11,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:50:11,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172817975]
[2023-11-19 07:50:11,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172817975] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:50:11,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157968791]
[2023-11-19 07:50:11,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:50:11,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:50:11,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:50:11,158 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 07:50:11,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-11-19 07:50:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:11,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 41 conjunts are in the unsatisfiable core
[2023-11-19 07:50:11,353 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:50:11,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13
[2023-11-19 07:50:11,660 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 38 treesize of output 20
[2023-11-19 07:50:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-19 07:50:11,753 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-19 07:50:11,886 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 38 treesize of output 32
[2023-11-19 07:50:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-19 07:50:11,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157968791] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-19 07:50:11,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-19 07:50:11,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 31
[2023-11-19 07:50:11,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046108025]
[2023-11-19 07:50:11,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-19 07:50:11,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2023-11-19 07:50:11,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:50:11,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2023-11-19 07:50:11,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930
[2023-11-19 07:50:11,928 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 31 states, 31 states have (on average 2.774193548387097) internal successors, (86), 29 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4)
[2023-11-19 07:50:13,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:50:13,410 INFO L93 Difference]: Finished difference Result 175 states and 197 transitions.
[2023-11-19 07:50:13,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2023-11-19 07:50:13,411 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.774193548387097) internal successors, (86), 29 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46
[2023-11-19 07:50:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:50:13,413 INFO L225 Difference]: With dead ends: 175
[2023-11-19 07:50:13,413 INFO L226 Difference]: Without dead ends: 173
[2023-11-19 07:50:13,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=332, Invalid=2424, Unknown=0, NotChecked=0, Total=2756
[2023-11-19 07:50:13,423 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 308 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2023-11-19 07:50:13,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 529 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2023-11-19 07:50:13,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states.
[2023-11-19 07:50:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 106.
[2023-11-19 07:50:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 101 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2023-11-19 07:50:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions.
[2023-11-19 07:50:13,465 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 46
[2023-11-19 07:50:13,466 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:50:13,466 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions.
[2023-11-19 07:50:13,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.774193548387097) internal successors, (86), 29 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4)
[2023-11-19 07:50:13,467 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions.
[2023-11-19 07:50:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2023-11-19 07:50:13,468 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:50:13,468 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:50:13,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2023-11-19 07:50:13,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2023-11-19 07:50:13,698 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:50:13,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:50:13,698 INFO L85 PathProgramCache]: Analyzing trace with hash 216494684, now seen corresponding path program 5 times
[2023-11-19 07:50:13,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:50:13,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777630738]
[2023-11-19 07:50:13,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:50:13,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:50:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:13,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-19 07:50:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:13,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:50:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-19 07:50:13,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:50:13,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777630738]
[2023-11-19 07:50:13,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777630738] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:50:13,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251171641]
[2023-11-19 07:50:13,996 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-11-19 07:50:13,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:50:13,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:50:13,998 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 07:50:14,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2023-11-19 07:50:14,209 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s)
[2023-11-19 07:50:14,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-19 07:50:14,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjunts are in the unsatisfiable core
[2023-11-19 07:50:14,219 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:50:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2023-11-19 07:50:14,256 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-19 07:50:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2023-11-19 07:50:14,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251171641] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-19 07:50:14,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-19 07:50:14,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13
[2023-11-19 07:50:14,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415517195]
[2023-11-19 07:50:14,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-19 07:50:14,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2023-11-19 07:50:14,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:50:14,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2023-11-19 07:50:14,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156
[2023-11-19 07:50:14,313 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2023-11-19 07:50:14,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:50:14,516 INFO L93 Difference]: Finished difference Result 140 states and 160 transitions.
[2023-11-19 07:50:14,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2023-11-19 07:50:14,517 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46
[2023-11-19 07:50:14,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:50:14,518 INFO L225 Difference]: With dead ends: 140
[2023-11-19 07:50:14,518 INFO L226 Difference]: Without dead ends: 76
[2023-11-19 07:50:14,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380
[2023-11-19 07:50:14,520 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 48 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-11-19 07:50:14,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 174 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-11-19 07:50:14,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states.
[2023-11-19 07:50:14,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67.
[2023-11-19 07:50:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2023-11-19 07:50:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions.
[2023-11-19 07:50:14,541 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 46
[2023-11-19 07:50:14,541 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:50:14,541 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions.
[2023-11-19 07:50:14,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2023-11-19 07:50:14,542 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions.
[2023-11-19 07:50:14,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2023-11-19 07:50:14,543 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:50:14,543 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:50:14,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2023-11-19 07:50:14,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:50:14,774 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:50:14,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:50:14,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1865194857, now seen corresponding path program 2 times
[2023-11-19 07:50:14,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:50:14,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227658524]
[2023-11-19 07:50:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:50:14,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:50:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:14,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-19 07:50:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:14,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:50:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2023-11-19 07:50:14,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:50:14,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227658524]
[2023-11-19 07:50:14,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227658524] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:50:14,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958659519]
[2023-11-19 07:50:14,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-19 07:50:14,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:50:14,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:50:14,988 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 07:50:15,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2023-11-19 07:50:15,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-19 07:50:15,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-19 07:50:15,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-11-19 07:50:15,222 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:50:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2023-11-19 07:50:15,266 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-19 07:50:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2023-11-19 07:50:15,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958659519] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-19 07:50:15,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-19 07:50:15,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8
[2023-11-19 07:50:15,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108874475]
[2023-11-19 07:50:15,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-19 07:50:15,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-19 07:50:15,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:50:15,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-19 07:50:15,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2023-11-19 07:50:15,324 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2023-11-19 07:50:15,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:50:15,446 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions.
[2023-11-19 07:50:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2023-11-19 07:50:15,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47
[2023-11-19 07:50:15,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:50:15,448 INFO L225 Difference]: With dead ends: 69
[2023-11-19 07:50:15,448 INFO L226 Difference]: Without dead ends: 39
[2023-11-19 07:50:15,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2023-11-19 07:50:15,449 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 25 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-11-19 07:50:15,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 113 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-11-19 07:50:15,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2023-11-19 07:50:15,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39.
[2023-11-19 07:50:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2023-11-19 07:50:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions.
[2023-11-19 07:50:15,458 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 47
[2023-11-19 07:50:15,458 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:50:15,458 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions.
[2023-11-19 07:50:15,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2023-11-19 07:50:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions.
[2023-11-19 07:50:15,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2023-11-19 07:50:15,459 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-19 07:50:15,459 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 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:15,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2023-11-19 07:50:15,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:50:15,675 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-19 07:50:15,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:50:15,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2056935971, now seen corresponding path program 6 times
[2023-11-19 07:50:15,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:50:15,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475863144]
[2023-11-19 07:50:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:50:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:50:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:15,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-19 07:50:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:15,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2023-11-19 07:50:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:15,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2023-11-19 07:50:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:50:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2023-11-19 07:50:15,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:50:15,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475863144]
[2023-11-19 07:50:15,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475863144] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-19 07:50:15,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144429402]
[2023-11-19 07:50:15,841 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2023-11-19 07:50:15,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:50:15,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:50:15,843 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-19 07:50:15,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2023-11-19 07:50:16,095 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s)
[2023-11-19 07:50:16,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-19 07:50:16,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-11-19 07:50:16,100 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 07:50:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2023-11-19 07:50:16,131 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-19 07:50:16,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144429402] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:50:16,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-19 07:50:16,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6
[2023-11-19 07:50:16,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241508236]
[2023-11-19 07:50:16,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:50:16,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:50:16,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:50:16,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:50:16,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:50:16,135 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2023-11-19 07:50:16,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-19 07:50:16,149 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions.
[2023-11-19 07:50:16,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:50:16,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48
[2023-11-19 07:50:16,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-19 07:50:16,150 INFO L225 Difference]: With dead ends: 44
[2023-11-19 07:50:16,150 INFO L226 Difference]: Without dead ends: 0
[2023-11-19 07:50:16,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:50:16,159 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 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:16,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 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:16,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2023-11-19 07:50:16,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2023-11-19 07:50:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:50:16,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2023-11-19 07:50:16,161 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48
[2023-11-19 07:50:16,161 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-19 07:50:16,162 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2023-11-19 07:50:16,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2023-11-19 07:50:16,162 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2023-11-19 07:50:16,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2023-11-19 07:50:16,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-11-19 07:50:16,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2023-11-19 07:50:16,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-19 07:50:16,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2023-11-19 07:50:17,337 INFO L899 garLoopResultBuilder]: For program point sll_circular_create_returnLabel#1(lines 583 594) no Hoare annotation was computed.
[2023-11-19 07:50:17,337 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 620 639) no Hoare annotation was computed.
[2023-11-19 07:50:17,338 INFO L895 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0)) (.cse13 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (let ((.cse0 (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |#memory_$Pointer$.base| .cse13) 0))) (.cse1 (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0)) (.cse2 (not (= .cse13 |ULTIMATE.start_sll_circular_create_#res#1.base|))) (.cse3 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse5 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse6 (= 3 |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse12 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse7 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0)) (.cse8 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse9 (= (select (select |#memory_$Pointer$.base| .cse11) 0) |ULTIMATE.start_main_~s~0#1.base|)) (.cse10 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 0) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_sll_circular_update_at_~index#1| 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 0) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) .cse9 .cse10) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 (= 2 |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse2 .cse3 .cse4 (not (= .cse11 |ULTIMATE.start_main_~s~0#1.base|)) .cse12 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_update_at_~index#1|) (= 3 (select (select |#memory_int| .cse11) 4)) .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12 (= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) .cse7 .cse8 (= .cse11 |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (not .cse4) .cse9 .cse10))))
[2023-11-19 07:50:17,338 INFO L899 garLoopResultBuilder]: For program point L614-3(lines 614 617) no Hoare annotation was computed.
[2023-11-19 07:50:17,338 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2023-11-19 07:50:17,338 INFO L899 garLoopResultBuilder]: For program point L631(lines 631 633) no Hoare annotation was computed.
[2023-11-19 07:50:17,338 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true
[2023-11-19 07:50:17,338 INFO L899 garLoopResultBuilder]: For program point L598-3(lines 598 602) no Hoare annotation was computed.
[2023-11-19 07:50:17,339 INFO L899 garLoopResultBuilder]: For program point sll_circular_get_data_at_returnLabel#1(lines 606 612) no Hoare annotation was computed.
[2023-11-19 07:50:17,339 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse16 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse17 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (let ((.cse0 (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |#memory_$Pointer$.base| .cse17) 0))) (.cse2 (not (= .cse17 |ULTIMATE.start_sll_circular_create_#res#1.base|))) (.cse3 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse6 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse7 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse8 (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0)) 4))) (.cse9 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0)) (.cse10 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0)) (.cse12 (= 2 (select .cse16 4))) (.cse13 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse1 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 3 (select .cse5 4)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse14 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 0))) (and .cse0 (not (= .cse14 |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) .cse2 .cse3 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) .cse4 (= 3 (select (select |#memory_int| .cse14) 4)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 0) 0) .cse12 .cse13)) (let ((.cse15 (select .cse5 (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)))) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 (= (+ (* 2 (div (* (- 1) .cse15) 2)) |ULTIMATE.start_main_~expected~0#1|) 0) (= (select .cse16 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) 2) .cse11 (= (mod .cse15 2) 0))))))
[2023-11-19 07:50:17,339 INFO L899 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed.
[2023-11-19 07:50:17,339 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed.
[2023-11-19 07:50:17,339 INFO L899 garLoopResultBuilder]: For program point L625-2(lines 625 628) no Hoare annotation was computed.
[2023-11-19 07:50:17,340 INFO L895 garLoopResultBuilder]: At program point L625-3(lines 625 628) the Hoare annotation is: (let ((.cse10 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) 0)) (.cse7 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0))) (let ((.cse3 (not (= .cse7 |ULTIMATE.start_main_~s~0#1.base|))) (.cse0 (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |#memory_$Pointer$.base| .cse10) 0))) (.cse1 (not (= .cse10 |ULTIMATE.start_sll_circular_create_#res#1.base|))) (.cse2 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse4 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse9 (= 3 (select (select |#memory_int| .cse7) 4))) (.cse5 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse8 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~i~0#1| 1) .cse3 .cse4 .cse5 .cse6 (= (select (select |#memory_$Pointer$.base| .cse7) 0) |ULTIMATE.start_main_~s~0#1.base|) .cse8) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse8) (and .cse0 .cse1 .cse2 .cse4 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) .cse9 .cse5 .cse6 (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse8))))
[2023-11-19 07:50:17,340 INFO L899 garLoopResultBuilder]: For program point L625-4(lines 625 628) no Hoare annotation was computed.
[2023-11-19 07:50:17,340 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2))
[2023-11-19 07:50:17,340 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed.
[2023-11-19 07:50:17,340 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed.
[2023-11-19 07:50:17,341 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 637) no Hoare annotation was computed.
[2023-11-19 07:50:17,341 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (or (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) .cse2 .cse3) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) .cse0 .cse1 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) .cse3 (not .cse2))))
[2023-11-19 07:50:17,341 INFO L899 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed.
[2023-11-19 07:50:17,341 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2023-11-19 07:50:17,341 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed.
[2023-11-19 07:50:17,342 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2))
[2023-11-19 07:50:17,342 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed.
[2023-11-19 07:50:17,342 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 620 639) no Hoare annotation was computed.
[2023-11-19 07:50:17,342 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed.
[2023-11-19 07:50:17,342 INFO L899 garLoopResultBuilder]: For program point L629-2(lines 629 634) no Hoare annotation was computed.
[2023-11-19 07:50:17,343 INFO L895 garLoopResultBuilder]: At program point L629-3(lines 629 634) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |#memory_$Pointer$.base| .cse0) 0)) (not (= .cse0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0) (= 3 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0) .cse1 (= 2 (select .cse2 4)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) .cse1) (and (<= |ULTIMATE.start_main_~i~0#1| 0) (= (select .cse2 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) 2) .cse1)))
[2023-11-19 07:50:17,343 INFO L899 garLoopResultBuilder]: For program point L629-4(lines 629 634) no Hoare annotation was computed.
[2023-11-19 07:50:17,343 INFO L899 garLoopResultBuilder]: For program point L613(lines 613 619) no Hoare annotation was computed.
[2023-11-19 07:50:17,343 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed.
[2023-11-19 07:50:17,343 INFO L899 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed.
[2023-11-19 07:50:17,343 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed.
[2023-11-19 07:50:17,344 INFO L899 garLoopResultBuilder]: For program point node_createFINAL(lines 574 582) no Hoare annotation was computed.
[2023-11-19 07:50:17,344 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))
[2023-11-19 07:50:17,344 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed.
[2023-11-19 07:50:17,348 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1]
[2023-11-19 07:50:17,350 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-19 07:50:17,365 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated
[2023-11-19 07:50:17,366 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][0] could not be translated
[2023-11-19 07:50:17,366 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][0] could not be translated
[2023-11-19 07:50:17,368 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,368 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
[2023-11-19 07:50:17,369 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
[2023-11-19 07:50:17,369 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,369 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,370 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated
[2023-11-19 07:50:17,370 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated
[2023-11-19 07:50:17,370 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
[2023-11-19 07:50:17,370 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated
[2023-11-19 07:50:17,371 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][~s~0!offset + 4] could not be translated
[2023-11-19 07:50:17,374 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,374 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
[2023-11-19 07:50:17,374 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,374 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head!base][0] could not be translated
[2023-11-19 07:50:17,375 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
[2023-11-19 07:50:17,375 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,375 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,376 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,376 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0
[2023-11-19 07:50:17,376 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0
[2023-11-19 07:50:17,376 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
[2023-11-19 07:50:17,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0
[2023-11-19 07:50:17,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated
[2023-11-19 07:50:17,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~s~0!base][0]][0] could not be translated
[2023-11-19 07:50:17,378 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0
[2023-11-19 07:50:17,378 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,378 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
[2023-11-19 07:50:17,378 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0
[2023-11-19 07:50:17,379 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,379 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
[2023-11-19 07:50:17,379 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,379 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,380 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,380 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0
[2023-11-19 07:50:17,380 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated
[2023-11-19 07:50:17,380 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0
[2023-11-19 07:50:17,381 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated
[2023-11-19 07:50:17,381 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0
[2023-11-19 07:50:17,381 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated
[2023-11-19 07:50:17,381 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
[2023-11-19 07:50:17,382 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0
[2023-11-19 07:50:17,382 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,382 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
[2023-11-19 07:50:17,382 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,383 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
[2023-11-19 07:50:17,383 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,383 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,383 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0
[2023-11-19 07:50:17,384 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated
[2023-11-19 07:50:17,384 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
[2023-11-19 07:50:17,384 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0
[2023-11-19 07:50:17,384 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated
[2023-11-19 07:50:17,385 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,385 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,385 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0
[2023-11-19 07:50:17,385 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~s~0!base][0]][0] could not be translated
[2023-11-19 07:50:17,385 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0
[2023-11-19 07:50:17,387 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,388 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
[2023-11-19 07:50:17,388 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
[2023-11-19 07:50:17,388 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,389 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,389 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated
[2023-11-19 07:50:17,389 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated
[2023-11-19 07:50:17,389 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
[2023-11-19 07:50:17,390 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~s~0!base][0]][0] could not be translated
[2023-11-19 07:50:17,390 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,390 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
[2023-11-19 07:50:17,390 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
[2023-11-19 07:50:17,391 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,391 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,391 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated
[2023-11-19 07:50:17,391 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated
[2023-11-19 07:50:17,392 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated
[2023-11-19 07:50:17,392 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
[2023-11-19 07:50:17,392 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,392 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
[2023-11-19 07:50:17,393 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
[2023-11-19 07:50:17,393 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,393 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,393 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated
[2023-11-19 07:50:17,394 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated
[2023-11-19 07:50:17,394 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
[2023-11-19 07:50:17,394 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated
[2023-11-19 07:50:17,396 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,397 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
[2023-11-19 07:50:17,397 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
[2023-11-19 07:50:17,397 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,397 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,398 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0
[2023-11-19 07:50:17,398 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][4] could not be translated
[2023-11-19 07:50:17,398 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated
[2023-11-19 07:50:17,398 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0
[2023-11-19 07:50:17,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated
[2023-11-19 07:50:17,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
[2023-11-19 07:50:17,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0
[2023-11-19 07:50:17,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated
[2023-11-19 07:50:17,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
[2023-11-19 07:50:17,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated
[2023-11-19 07:50:17,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
[2023-11-19 07:50:17,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,402 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0
[2023-11-19 07:50:17,402 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][0]][4] could not be translated
[2023-11-19 07:50:17,402 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated
[2023-11-19 07:50:17,402 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0
[2023-11-19 07:50:17,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated
[2023-11-19 07:50:17,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
[2023-11-19 07:50:17,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
[2023-11-19 07:50:17,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0
[2023-11-19 07:50:17,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head!base][0] could not be translated
[2023-11-19 07:50:17,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated
[2023-11-19 07:50:17,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0
[2023-11-19 07:50:17,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][~head!offset + 4] could not be translated
[2023-11-19 07:50:17,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0
[2023-11-19 07:50:17,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][~s~0!offset + 4] could not be translated
[2023-11-19 07:50:17,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0
[2023-11-19 07:50:17,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][~head!offset + 4] could not be translated
[2023-11-19 07:50:17,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:50:17 BoogieIcfgContainer
[2023-11-19 07:50:17,406 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-19 07:50:17,406 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-19 07:50:17,407 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-19 07:50:17,407 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-19 07:50:17,407 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:49:52" (3/4) ...
[2023-11-19 07:50:17,410 INFO L137 WitnessPrinter]: Generating witness for correct program
[2023-11-19 07:50:17,414 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create
[2023-11-19 07:50:17,420 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges
[2023-11-19 07:50:17,421 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges
[2023-11-19 07:50:17,421 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2023-11-19 07:50:17,421 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2023-11-19 07:50:17,532 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml
[2023-11-19 07:50:17,533 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/witness.yml
[2023-11-19 07:50:17,533 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-19 07:50:17,534 INFO L158 Benchmark]: Toolchain (without parser) took 26051.19ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 116.6MB in the beginning and 139.4MB in the end (delta: -22.7MB). Peak memory consumption was 145.9MB. Max. memory is 16.1GB.
[2023-11-19 07:50:17,534 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 151.0MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:50:17,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.31ms. Allocated memory is still 151.0MB. Free memory was 116.1MB in the beginning and 98.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2023-11-19 07:50:17,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.11ms. Allocated memory is still 151.0MB. Free memory was 98.7MB in the beginning and 96.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:50:17,536 INFO L158 Benchmark]: Boogie Preprocessor took 71.02ms. Allocated memory is still 151.0MB. Free memory was 96.6MB in the beginning and 94.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:50:17,536 INFO L158 Benchmark]: RCFGBuilder took 456.48ms. Allocated memory is still 151.0MB. Free memory was 94.8MB in the beginning and 79.2MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2023-11-19 07:50:17,536 INFO L158 Benchmark]: TraceAbstraction took 24776.44ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 78.7MB in the beginning and 144.6MB in the end (delta: -65.9MB). Peak memory consumption was 104.0MB. Max. memory is 16.1GB.
[2023-11-19 07:50:17,537 INFO L158 Benchmark]: Witness Printer took 127.05ms. Allocated memory is still 318.8MB. Free memory was 144.6MB in the beginning and 139.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-11-19 07:50:17,539 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.26ms. Allocated memory is still 151.0MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 532.31ms. Allocated memory is still 151.0MB. Free memory was 116.1MB in the beginning and 98.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 80.11ms. Allocated memory is still 151.0MB. Free memory was 98.7MB in the beginning and 96.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 71.02ms. Allocated memory is still 151.0MB. Free memory was 96.6MB in the beginning and 94.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 456.48ms. Allocated memory is still 151.0MB. Free memory was 94.8MB in the beginning and 79.2MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 24776.44ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 78.7MB in the beginning and 144.6MB in the end (delta: -65.9MB). Peak memory consumption was 104.0MB. Max. memory is 16.1GB.
* Witness Printer took 127.05ms. Allocated memory is still 318.8MB. Free memory was 144.6MB in the beginning and 139.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head~0!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head~0!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][~s~0!offset + 4] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~s~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~i~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~len~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~s~0!base][0]][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~s~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~i~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~s~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~s~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~i~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~len~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~i~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~len~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~s~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~s~0!base][0]][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~s~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~s~0!base][0]][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~s~0!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~i~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][4] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~expected~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~len~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[#res!base][0]][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~head!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~i~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~head!base][0]][4] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~s~0!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~expected~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_int[#memory_$Pointer$.base[~s~0!base][0]][4] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#res!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~len~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~head!base][0] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~i~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][~head!offset + 4] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~expected~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][~s~0!offset + 4] could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable ~len~0
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: ArrayAccessExpression #memory_int[~head!base][~head!offset + 4] could not be translated
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- PositiveResult [Line: 637]: a call to reach_error is unreachable
For all program executions holds that a call to reach_error is unreachable at this location
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.6s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 896 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 892 mSDsluCounter, 2154 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 420 IncrementalHoareTripleChecker+Unchecked, 1783 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2284 IncrementalHoareTripleChecker+Invalid, 2793 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 371 mSDtfsCounter, 2284 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 952 GetRequests, 719 SyntacticMatches, 13 SemanticMatches, 220 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1867 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=11, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 147 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 28 NumberOfFragments, 847 HoareAnnotationTreeSize, 11 FomulaSimplifications, 7899 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 306 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 1008 NumberOfCodeBlocks, 967 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1230 ConstructedInterpolants, 17 QuantifiedInterpolants, 6203 SizeOfPredicates, 81 NumberOfNonLiveVariables, 3327 ConjunctsInSsa, 210 ConjunctsInUnsatCore, 32 InterpolantComputations, 9 PerfectInterpolantSequences, 444/556 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
- AllSpecificationsHoldResult: All specifications hold
1 specifications checked. All of them hold
- InvariantResult [Line: 598]: Loop Invariant
Derived loop invariant: 1
- InvariantResult [Line: 586]: Loop Invariant
Derived loop invariant: (((2 == len) && (len == 2)) || ((len <= 1) && (len == 2)))
- InvariantResult [Line: 629]: Loop Invariant
Derived loop invariant: ((((i == 1) && (len == 2)) || (((i + 1) <= 0) && (len == 2))) || ((i <= 0) && (len == 2)))
- InvariantResult [Line: 614]: Loop Invariant
Derived loop invariant: ((((3 == data) && (index == 1)) || ((2 == data) && (index <= 0))) || ((3 == data) && (index == 0)))
- InvariantResult [Line: 625]: Loop Invariant
Derived loop invariant: ((((i == 1) && (len == 2)) || ((i == 0) && (len == 2))) || (((i + 1) <= 0) && (len == 2)))
- InvariantResult [Line: 607]: Loop Invariant
Derived loop invariant: (((index <= 0) || (index == 1)) || (index <= 0))
RESULT: Ultimate proved your program to be correct!
[2023-11-19 07:50:17,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd3981f2-870e-440f-8961-ec984ba7583d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE