./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf89a9db9089e52f60762f5e253ea7c1b22972a3 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 00:32:54,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:32:54,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:32:54,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:32:54,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:32:54,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:32:54,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:32:54,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:32:54,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:32:54,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:32:54,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:32:54,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:32:54,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:32:54,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:32:54,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:32:54,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:32:54,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:32:54,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:32:54,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:32:54,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:32:54,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:32:54,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:32:54,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:32:54,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:32:54,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:32:54,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:32:54,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:32:54,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:32:54,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:32:54,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:32:54,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:32:54,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:32:54,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:32:54,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:32:54,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:32:54,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:32:54,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:32:54,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:32:54,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:32:54,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:32:54,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:32:54,867 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-11 00:32:54,912 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:32:54,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:32:54,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:32:54,918 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:32:54,918 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:32:54,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:32:54,919 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:32:54,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:32:54,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:32:54,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:32:54,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 00:32:54,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 00:32:54,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 00:32:54,921 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:32:54,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:32:54,922 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:32:54,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 00:32:54,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:32:54,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:32:54,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 00:32:54,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:32:54,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:32:54,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 00:32:54,924 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 00:32:54,924 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:32:54,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 00:32:54,924 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 00:32:54,925 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:32:54,925 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/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_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf89a9db9089e52f60762f5e253ea7c1b22972a3 [2021-10-11 00:32:55,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:32:55,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:32:55,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:32:55,224 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:32:55,228 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:32:55,229 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-10-11 00:32:55,323 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/data/80cebe5aa/c2a3892e8b764b549e58d6ae81ef7502/FLAG17dbdd074 [2021-10-11 00:32:55,823 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:32:55,824 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-10-11 00:32:55,837 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/data/80cebe5aa/c2a3892e8b764b549e58d6ae81ef7502/FLAG17dbdd074 [2021-10-11 00:32:56,142 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/data/80cebe5aa/c2a3892e8b764b549e58d6ae81ef7502 [2021-10-11 00:32:56,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:32:56,145 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:32:56,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:32:56,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:32:56,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:32:56,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:32:56" (1/1) ... [2021-10-11 00:32:56,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c3d84cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:56, skipping insertion in model container [2021-10-11 00:32:56,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:32:56" (1/1) ... [2021-10-11 00:32:56,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:32:56,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:32:56,547 WARN L226 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_80bbdd0c-cdf8-4c2e-a056-44859190142c/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2021-10-11 00:32:56,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:32:56,558 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:32:56,600 WARN L226 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_80bbdd0c-cdf8-4c2e-a056-44859190142c/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2021-10-11 00:32:56,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:32:56,652 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:32:56,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:56 WrapperNode [2021-10-11 00:32:56,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:32:56,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:32:56,654 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:32:56,654 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:32:56,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:56" (1/1) ... [2021-10-11 00:32:56,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:56" (1/1) ... [2021-10-11 00:32:56,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:32:56,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:32:56,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:32:56,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:32:56,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:56" (1/1) ... [2021-10-11 00:32:56,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:56" (1/1) ... [2021-10-11 00:32:56,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:56" (1/1) ... [2021-10-11 00:32:56,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:56" (1/1) ... [2021-10-11 00:32:56,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:56" (1/1) ... [2021-10-11 00:32:56,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:56" (1/1) ... [2021-10-11 00:32:56,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:56" (1/1) ... [2021-10-11 00:32:56,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:32:56,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:32:56,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:32:56,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:32:56,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:56" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:32:56,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-11 00:32:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 00:32:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-11 00:32:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-11 00:32:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:32:56,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-11 00:32:56,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 00:32:56,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:32:56,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:32:56,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:32:57,267 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:32:57,269 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2021-10-11 00:32:57,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:32:57 BoogieIcfgContainer [2021-10-11 00:32:57,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:32:57,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 00:32:57,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 00:32:57,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 00:32:57,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:32:56" (1/3) ... [2021-10-11 00:32:57,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c599a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:32:57, skipping insertion in model container [2021-10-11 00:32:57,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:56" (2/3) ... [2021-10-11 00:32:57,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c599a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:32:57, skipping insertion in model container [2021-10-11 00:32:57,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:32:57" (3/3) ... [2021-10-11 00:32:57,281 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2021-10-11 00:32:57,295 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 00:32:57,299 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-10-11 00:32:57,319 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-11 00:32:57,342 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 00:32:57,343 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 00:32:57,343 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 00:32:57,343 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:32:57,343 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:32:57,344 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 00:32:57,344 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:32:57,344 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 00:32:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2021-10-11 00:32:57,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 00:32:57,362 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:57,362 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:57,363 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:57,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:57,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1121238131, now seen corresponding path program 1 times [2021-10-11 00:32:57,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:57,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636638578] [2021-10-11 00:32:57,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:57,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:57,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636638578] [2021-10-11 00:32:57,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:57,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:32:57,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275310424] [2021-10-11 00:32:57,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-10-11 00:32:57,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:57,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-11 00:32:57,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-11 00:32:57,531 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2021-10-11 00:32:57,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:57,548 INFO L93 Difference]: Finished difference Result 50 states and 73 transitions. [2021-10-11 00:32:57,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-11 00:32:57,550 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2021-10-11 00:32:57,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:57,558 INFO L225 Difference]: With dead ends: 50 [2021-10-11 00:32:57,558 INFO L226 Difference]: Without dead ends: 22 [2021-10-11 00:32:57,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-11 00:32:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-10-11 00:32:57,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-10-11 00:32:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-10-11 00:32:57,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-10-11 00:32:57,592 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2021-10-11 00:32:57,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:57,593 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-10-11 00:32:57,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-10-11 00:32:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-10-11 00:32:57,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 00:32:57,594 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:57,594 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:57,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 00:32:57,595 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:57,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:57,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1860179837, now seen corresponding path program 1 times [2021-10-11 00:32:57,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:57,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259280256] [2021-10-11 00:32:57,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:57,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259280256] [2021-10-11 00:32:57,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:57,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:32:57,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672856361] [2021-10-11 00:32:57,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:32:57,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:57,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:32:57,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:32:57,660 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2021-10-11 00:32:57,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:57,694 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2021-10-11 00:32:57,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:32:57,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2021-10-11 00:32:57,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:57,699 INFO L225 Difference]: With dead ends: 42 [2021-10-11 00:32:57,700 INFO L226 Difference]: Without dead ends: 27 [2021-10-11 00:32:57,700 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:32:57,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-10-11 00:32:57,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2021-10-11 00:32:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-10-11 00:32:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-10-11 00:32:57,704 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2021-10-11 00:32:57,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:57,704 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-10-11 00:32:57,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:32:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-10-11 00:32:57,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-11 00:32:57,705 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:57,705 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:57,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 00:32:57,705 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:57,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:57,705 INFO L82 PathProgramCache]: Analyzing trace with hash -2027989739, now seen corresponding path program 1 times [2021-10-11 00:32:57,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:57,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290930887] [2021-10-11 00:32:57,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:57,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290930887] [2021-10-11 00:32:57,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180067066] [2021-10-11 00:32:57,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:32:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:57,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-11 00:32:57,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:32:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:58,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:32:58,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-10-11 00:32:58,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554450981] [2021-10-11 00:32:58,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:32:58,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:58,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:32:58,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:32:58,013 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 5 states. [2021-10-11 00:32:58,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:58,042 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-10-11 00:32:58,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:32:58,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2021-10-11 00:32:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:58,044 INFO L225 Difference]: With dead ends: 43 [2021-10-11 00:32:58,044 INFO L226 Difference]: Without dead ends: 28 [2021-10-11 00:32:58,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:32:58,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-10-11 00:32:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-10-11 00:32:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2021-10-11 00:32:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-10-11 00:32:58,049 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2021-10-11 00:32:58,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:58,050 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-10-11 00:32:58,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:32:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-10-11 00:32:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 00:32:58,051 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:58,051 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:58,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-10-11 00:32:58,280 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:58,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:58,280 INFO L82 PathProgramCache]: Analyzing trace with hash -650193283, now seen corresponding path program 2 times [2021-10-11 00:32:58,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:58,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86739850] [2021-10-11 00:32:58,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:58,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-11 00:32:58,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86739850] [2021-10-11 00:32:58,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:58,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:32:58,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488564689] [2021-10-11 00:32:58,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:32:58,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:58,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:32:58,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:32:58,431 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2021-10-11 00:32:58,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:58,462 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2021-10-11 00:32:58,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:32:58,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2021-10-11 00:32:58,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:58,463 INFO L225 Difference]: With dead ends: 49 [2021-10-11 00:32:58,464 INFO L226 Difference]: Without dead ends: 40 [2021-10-11 00:32:58,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:32:58,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-10-11 00:32:58,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2021-10-11 00:32:58,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2021-10-11 00:32:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-10-11 00:32:58,470 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2021-10-11 00:32:58,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:58,471 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-10-11 00:32:58,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:32:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-10-11 00:32:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-11 00:32:58,472 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:58,472 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:58,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 00:32:58,473 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:58,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1288329753, now seen corresponding path program 1 times [2021-10-11 00:32:58,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:58,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408686676] [2021-10-11 00:32:58,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-11 00:32:58,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408686676] [2021-10-11 00:32:58,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:58,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:32:58,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302426350] [2021-10-11 00:32:58,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:32:58,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:58,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:32:58,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:32:58,575 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2021-10-11 00:32:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:58,660 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2021-10-11 00:32:58,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:32:58,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2021-10-11 00:32:58,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:58,662 INFO L225 Difference]: With dead ends: 54 [2021-10-11 00:32:58,662 INFO L226 Difference]: Without dead ends: 41 [2021-10-11 00:32:58,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:32:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-10-11 00:32:58,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2021-10-11 00:32:58,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-10-11 00:32:58,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-10-11 00:32:58,670 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 27 [2021-10-11 00:32:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:58,670 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-10-11 00:32:58,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:32:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-10-11 00:32:58,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-11 00:32:58,671 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:58,671 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:58,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 00:32:58,672 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:58,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:58,672 INFO L82 PathProgramCache]: Analyzing trace with hash 883328756, now seen corresponding path program 1 times [2021-10-11 00:32:58,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:58,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029401417] [2021-10-11 00:32:58,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:58,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-11 00:32:58,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029401417] [2021-10-11 00:32:58,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122282930] [2021-10-11 00:32:58,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:32:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:58,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-11 00:32:58,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:32:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-11 00:32:58,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:32:58,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-10-11 00:32:58,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591347446] [2021-10-11 00:32:58,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-10-11 00:32:58,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:58,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-11 00:32:58,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:32:58,962 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2021-10-11 00:32:59,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:59,045 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2021-10-11 00:32:59,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:32:59,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2021-10-11 00:32:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:59,046 INFO L225 Difference]: With dead ends: 52 [2021-10-11 00:32:59,047 INFO L226 Difference]: Without dead ends: 43 [2021-10-11 00:32:59,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:32:59,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-10-11 00:32:59,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2021-10-11 00:32:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2021-10-11 00:32:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-10-11 00:32:59,055 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2021-10-11 00:32:59,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:59,055 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-10-11 00:32:59,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-10-11 00:32:59,056 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-10-11 00:32:59,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-11 00:32:59,057 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:59,057 INFO L422 BasicCegarLoop]: 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] [2021-10-11 00:32:59,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:32:59,272 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:59,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1177402658, now seen corresponding path program 2 times [2021-10-11 00:32:59,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:59,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320348334] [2021-10-11 00:32:59,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-11 00:32:59,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320348334] [2021-10-11 00:32:59,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:59,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:32:59,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643749914] [2021-10-11 00:32:59,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:32:59,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:59,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:32:59,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:32:59,388 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 5 states. [2021-10-11 00:32:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:59,478 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2021-10-11 00:32:59,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:32:59,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2021-10-11 00:32:59,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:59,480 INFO L225 Difference]: With dead ends: 51 [2021-10-11 00:32:59,480 INFO L226 Difference]: Without dead ends: 43 [2021-10-11 00:32:59,481 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:32:59,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-10-11 00:32:59,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2021-10-11 00:32:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2021-10-11 00:32:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-10-11 00:32:59,503 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 32 [2021-10-11 00:32:59,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:59,504 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-10-11 00:32:59,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:32:59,504 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-10-11 00:32:59,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-11 00:32:59,506 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:59,506 INFO L422 BasicCegarLoop]: 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] [2021-10-11 00:32:59,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 00:32:59,507 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:59,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:59,507 INFO L82 PathProgramCache]: Analyzing trace with hash -2088089927, now seen corresponding path program 1 times [2021-10-11 00:32:59,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:59,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378198624] [2021-10-11 00:32:59,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:00,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378198624] [2021-10-11 00:33:00,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797259632] [2021-10-11 00:33:00,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:00,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 83 conjunts are in the unsatisfiable core [2021-10-11 00:33:00,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:00,485 INFO L382 Elim1Store]: Elim1 did not use preprocessing 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 [2021-10-11 00:33:00,487 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-11 00:33:00,490 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:00,491 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-11 00:33:00,491 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-10-11 00:33:00,553 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:00,554 INFO L382 Elim1Store]: Elim1 did not use preprocessing 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 15 [2021-10-11 00:33:00,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:00,564 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-11 00:33:00,566 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:00,566 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-11 00:33:00,567 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-10-11 00:33:00,664 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-11 00:33:00,665 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-11 00:33:00,672 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:00,676 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-11 00:33:00,678 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-10-11 00:33:00,685 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:00,688 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-10-11 00:33:00,689 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:10 [2021-10-11 00:33:00,970 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_11|], 2=[|v_#memory_$Pointer$.offset_12|, |v_#memory_$Pointer$.base_12|]} [2021-10-11 00:33:00,977 INFO L382 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 23 [2021-10-11 00:33:00,978 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-11 00:33:00,991 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:01,000 INFO L382 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 86 [2021-10-11 00:33:01,004 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-10-11 00:33:01,013 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:01,047 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:01,048 INFO L382 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 109 [2021-10-11 00:33:01,053 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 2, 1] term [2021-10-11 00:33:01,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:01,055 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-10-11 00:33:01,061 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:01,062 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-10-11 00:33:01,063 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:134, output treesize:34 [2021-10-11 00:33:01,249 INFO L382 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 34 [2021-10-11 00:33:01,257 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-11 00:33:01,278 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:01,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-11 00:33:01,284 INFO L382 Elim1Store]: Elim1 did not use preprocessing 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 27 [2021-10-11 00:33:01,285 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-10-11 00:33:01,300 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:01,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-11 00:33:01,305 INFO L382 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 31 [2021-10-11 00:33:01,307 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-10-11 00:33:01,317 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:01,320 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-10-11 00:33:01,320 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:78, output treesize:34 [2021-10-11 00:33:01,494 INFO L382 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 29 [2021-10-11 00:33:01,496 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-11 00:33:01,508 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:01,512 INFO L382 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 19 [2021-10-11 00:33:01,513 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-10-11 00:33:01,522 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:01,524 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-10-11 00:33:01,524 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:23 [2021-10-11 00:33:01,613 INFO L382 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 15 [2021-10-11 00:33:01,617 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-11 00:33:01,624 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:01,625 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-10-11 00:33:01,625 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2021-10-11 00:33:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 00:33:01,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:33:01,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 35 [2021-10-11 00:33:01,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253782885] [2021-10-11 00:33:01,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-10-11 00:33:01,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:01,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-10-11 00:33:01,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2021-10-11 00:33:01,776 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 35 states. [2021-10-11 00:33:03,612 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 63 [2021-10-11 00:33:04,025 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2021-10-11 00:33:04,209 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2021-10-11 00:33:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:04,460 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2021-10-11 00:33:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-11 00:33:04,461 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 33 [2021-10-11 00:33:04,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:04,464 INFO L225 Difference]: With dead ends: 75 [2021-10-11 00:33:04,466 INFO L226 Difference]: Without dead ends: 73 [2021-10-11 00:33:04,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=414, Invalid=2666, Unknown=0, NotChecked=0, Total=3080 [2021-10-11 00:33:04,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-10-11 00:33:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2021-10-11 00:33:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2021-10-11 00:33:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2021-10-11 00:33:04,491 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 33 [2021-10-11 00:33:04,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:04,491 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2021-10-11 00:33:04,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2021-10-11 00:33:04,491 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2021-10-11 00:33:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-11 00:33:04,499 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:04,501 INFO L422 BasicCegarLoop]: 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] [2021-10-11 00:33:04,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:04,712 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:04,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:04,712 INFO L82 PathProgramCache]: Analyzing trace with hash -254624194, now seen corresponding path program 2 times [2021-10-11 00:33:04,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:04,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420799604] [2021-10-11 00:33:04,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-11 00:33:04,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420799604] [2021-10-11 00:33:04,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:04,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:33:04,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451418672] [2021-10-11 00:33:04,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:33:04,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:04,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:33:04,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:33:04,811 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand 6 states. [2021-10-11 00:33:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:04,870 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2021-10-11 00:33:04,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:33:04,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2021-10-11 00:33:04,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:04,876 INFO L225 Difference]: With dead ends: 60 [2021-10-11 00:33:04,876 INFO L226 Difference]: Without dead ends: 52 [2021-10-11 00:33:04,877 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:33:04,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-10-11 00:33:04,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-10-11 00:33:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2021-10-11 00:33:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2021-10-11 00:33:04,902 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 34 [2021-10-11 00:33:04,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:04,902 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2021-10-11 00:33:04,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:33:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2021-10-11 00:33:04,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-11 00:33:04,904 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:04,904 INFO L422 BasicCegarLoop]: 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] [2021-10-11 00:33:04,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 00:33:04,905 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:04,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:04,905 INFO L82 PathProgramCache]: Analyzing trace with hash 891797658, now seen corresponding path program 3 times [2021-10-11 00:33:04,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:04,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578341044] [2021-10-11 00:33:04,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:05,007 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-11 00:33:05,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578341044] [2021-10-11 00:33:05,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47333523] [2021-10-11 00:33:05,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:05,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-10-11 00:33:05,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 00:33:05,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-11 00:33:05,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:05,225 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-11 00:33:05,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:33:05,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2021-10-11 00:33:05,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245804791] [2021-10-11 00:33:05,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 00:33:05,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:05,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 00:33:05,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-10-11 00:33:05,228 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 9 states. [2021-10-11 00:33:05,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:05,374 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2021-10-11 00:33:05,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 00:33:05,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2021-10-11 00:33:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:05,379 INFO L225 Difference]: With dead ends: 63 [2021-10-11 00:33:05,380 INFO L226 Difference]: Without dead ends: 43 [2021-10-11 00:33:05,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-10-11 00:33:05,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-10-11 00:33:05,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2021-10-11 00:33:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2021-10-11 00:33:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-10-11 00:33:05,395 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 34 [2021-10-11 00:33:05,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:05,396 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-10-11 00:33:05,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 00:33:05,396 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-10-11 00:33:05,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-11 00:33:05,399 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:05,399 INFO L422 BasicCegarLoop]: 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] [2021-10-11 00:33:05,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:05,613 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:05,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:05,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1232245788, now seen corresponding path program 1 times [2021-10-11 00:33:05,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:05,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144506688] [2021-10-11 00:33:05,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-11 00:33:05,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144506688] [2021-10-11 00:33:05,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530158599] [2021-10-11 00:33:05,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:05,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 61 conjunts are in the unsatisfiable core [2021-10-11 00:33:05,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:06,132 INFO L382 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2021-10-11 00:33:06,133 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-11 00:33:06,141 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:06,143 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-10-11 00:33:06,146 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2021-10-11 00:33:06,293 INFO L382 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 10 [2021-10-11 00:33:06,295 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-11 00:33:06,304 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 00:33:06,305 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-10-11 00:33:06,305 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:13 [2021-10-11 00:33:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 00:33:06,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:33:06,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2021-10-11 00:33:06,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872358384] [2021-10-11 00:33:06,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-10-11 00:33:06,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:06,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-11 00:33:06,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-10-11 00:33:06,383 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 22 states. [2021-10-11 00:33:07,256 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2021-10-11 00:33:07,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:07,398 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2021-10-11 00:33:07,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-11 00:33:07,399 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2021-10-11 00:33:07,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:07,400 INFO L225 Difference]: With dead ends: 53 [2021-10-11 00:33:07,400 INFO L226 Difference]: Without dead ends: 51 [2021-10-11 00:33:07,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2021-10-11 00:33:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-10-11 00:33:07,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2021-10-11 00:33:07,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2021-10-11 00:33:07,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-10-11 00:33:07,411 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 39 [2021-10-11 00:33:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:07,411 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-10-11 00:33:07,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-10-11 00:33:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-10-11 00:33:07,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-11 00:33:07,412 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:07,412 INFO L422 BasicCegarLoop]: 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] [2021-10-11 00:33:07,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-10-11 00:33:07,636 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:07,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:07,636 INFO L82 PathProgramCache]: Analyzing trace with hash 506740339, now seen corresponding path program 2 times [2021-10-11 00:33:07,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:07,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238878419] [2021-10-11 00:33:07,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-11 00:33:07,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238878419] [2021-10-11 00:33:07,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059774759] [2021-10-11 00:33:07,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:07,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-11 00:33:07,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 00:33:07,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 00:33:07,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-11 00:33:07,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:33:07,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-10-11 00:33:07,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634279162] [2021-10-11 00:33:07,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 00:33:07,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:07,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 00:33:07,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-10-11 00:33:07,886 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 9 states. [2021-10-11 00:33:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:07,948 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2021-10-11 00:33:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:33:07,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2021-10-11 00:33:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:07,950 INFO L225 Difference]: With dead ends: 51 [2021-10-11 00:33:07,950 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 00:33:07,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-10-11 00:33:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 00:33:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 00:33:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 00:33:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 00:33:07,952 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2021-10-11 00:33:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:07,952 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:33:07,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 00:33:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 00:33:07,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 00:33:08,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:33:08,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 00:33:08,702 WARN L197 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 93 [2021-10-11 00:33:09,016 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2021-10-11 00:33:09,252 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2021-10-11 00:33:09,717 WARN L197 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 104 [2021-10-11 00:33:09,983 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2021-10-11 00:33:10,014 INFO L265 CegarLoopResult]: At program point L572(line 572) the Hoare annotation is: true [2021-10-11 00:33:10,014 INFO L262 CegarLoopResult]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2021-10-11 00:33:10,014 INFO L258 CegarLoopResult]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse5 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset)) (.cse15 (* 2 ULTIMATE.start_main_~len~0))) (let ((.cse0 (<= (+ ULTIMATE.start_sll_update_at_~index 2) ULTIMATE.start_main_~len~0)) (.cse1 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (.cse2 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse4 (<= ULTIMATE.start_main_~len~0 ULTIMATE.start_sll_update_at_~data)) (.cse3 (= 2 ULTIMATE.start_main_~len~0)) (.cse6 (= ULTIMATE.start_main_~s~0.offset ULTIMATE.start_sll_update_at_~head.offset)) (.cse7 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse9 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse10 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse11 (<= (+ ULTIMATE.start_sll_update_at_~data 2) .cse15)) (.cse12 (<= ULTIMATE.start_main_~len~0 .cse5)) (.cse13 (= ULTIMATE.start_node_create_~temp~0.offset 0))) (or (let ((.cse8 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= (+ .cse5 1) (+ ULTIMATE.start_main_~len~0 ULTIMATE.start_main_~i~0)) .cse6 .cse7 (not (= ULTIMATE.start_main_~s~0.base (select .cse8 4))) .cse9 .cse10 .cse11 .cse12 .cse13 (= (* ULTIMATE.start_main_~len~0 2) (+ (let ((.cse14 (+ ULTIMATE.start_main_~s~0.offset 4))) (select (select |#memory_int| (select .cse8 .cse14)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) .cse14))) 1)) (= ULTIMATE.start_main_~s~0.offset 0))) (and .cse0 (<= ULTIMATE.start_sll_get_data_at_~index 0) (<= (+ .cse5 2) .cse15) .cse1 .cse2 .cse4 .cse3 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0))))) [2021-10-11 00:33:10,015 INFO L262 CegarLoopResult]: For program point L622-4(lines 622 627) no Hoare annotation was computed. [2021-10-11 00:33:10,015 INFO L258 CegarLoopResult]: At program point L581(lines 574 582) the Hoare annotation is: (let ((.cse0 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse1 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse2 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse3 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse4 (= 2 ULTIMATE.start_main_~len~0))) (or (and .cse0 .cse1 .cse2 (= 2 ULTIMATE.start_sll_create_~len) .cse3 .cse4) (and .cse0 (<= 1 ULTIMATE.start_sll_create_~len) (not (= ULTIMATE.start_sll_create_~head~0.base ULTIMATE.start_node_create_~temp~0.base)) .cse1 .cse2 .cse3 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1) (not (= |ULTIMATE.start_node_create_#res.base| ULTIMATE.start_sll_create_~head~0.base)) .cse4))) [2021-10-11 00:33:10,015 INFO L262 CegarLoopResult]: For program point L606(lines 1 632) no Hoare annotation was computed. [2021-10-11 00:33:10,015 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 00:33:10,015 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-11 00:33:10,015 INFO L265 CegarLoopResult]: At program point L631(lines 613 632) the Hoare annotation is: true [2021-10-11 00:33:10,015 INFO L258 CegarLoopResult]: At program point L590(lines 583 591) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res.base|) 4) |ULTIMATE.start_sll_create_#res.base|)) (= ULTIMATE.start_sll_create_~head~0.offset 0) (= |ULTIMATE.start_node_create_#res.offset| 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_create_~head~0.base) 4) ULTIMATE.start_sll_create_~head~0.base)) (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1) (= ULTIMATE.start_node_create_~temp~0.offset 0) (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1) (= 2 ULTIMATE.start_main_~len~0) (= |ULTIMATE.start_sll_create_#res.offset| 0)) [2021-10-11 00:33:10,016 INFO L258 CegarLoopResult]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse20 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base))) (let ((.cse14 (select .cse20 4)) (.cse18 (+ ULTIMATE.start_main_~i~0 1)) (.cse23 (+ ULTIMATE.start_sll_update_at_~data 1)) (.cse19 (* 2 ULTIMATE.start_main_~len~0))) (let ((.cse16 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base)) (.cse0 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res.base|) 4) |ULTIMATE.start_sll_create_#res.base|))) (.cse1 (= ULTIMATE.start_sll_create_~head~0.offset 0)) (.cse2 (<= .cse23 .cse19)) (.cse13 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (.cse3 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse4 (<= .cse19 .cse23)) (.cse5 (= 2 ULTIMATE.start_main_~len~0)) (.cse6 (<= .cse18 ULTIMATE.start_main_~len~0)) (.cse7 (= |ULTIMATE.start_sll_create_#res.offset| 0)) (.cse8 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse17 (not (= ULTIMATE.start_main_~s~0.base .cse14))) (.cse9 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse10 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_create_~head~0.base) 4) ULTIMATE.start_sll_create_~head~0.base))) (.cse11 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse12 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse15 (= ULTIMATE.start_main_~s~0.offset 0)) (.cse22 (<= ULTIMATE.start_sll_update_at_~index ULTIMATE.start_main_~i~0))) (or (and .cse0 .cse1 (<= (+ ULTIMATE.start_sll_update_at_~index 2) ULTIMATE.start_main_~len~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not .cse13) (= ULTIMATE.start_sll_update_at_~head.base .cse14) .cse15 (= (select .cse16 4) ULTIMATE.start_sll_update_at_~head.offset) (< 0 ULTIMATE.start_main_~i~0)) (and .cse13 .cse3 (<= ULTIMATE.start_main_~len~0 ULTIMATE.start_sll_update_at_~data) .cse5 (= ULTIMATE.start_main_~s~0.offset ULTIMATE.start_sll_update_at_~head.offset) .cse8 .cse17 .cse9 .cse11 (< 0 .cse18) (<= (+ ULTIMATE.start_sll_update_at_~data 2) .cse19) .cse12 (= (* ULTIMATE.start_main_~len~0 2) (+ (let ((.cse21 (+ ULTIMATE.start_main_~s~0.offset 4))) (select (select |#memory_int| (select .cse20 .cse21)) (select .cse16 .cse21))) 1)) .cse15 .cse22 (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)) (and .cse0 (<= ULTIMATE.start_main_~len~0 (+ ULTIMATE.start_sll_update_at_~index 1)) .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 (= ULTIMATE.start_sll_update_at_~head.offset 0) .cse12 .cse15 .cse22))))) [2021-10-11 00:33:10,016 INFO L262 CegarLoopResult]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2021-10-11 00:33:10,016 INFO L262 CegarLoopResult]: For program point L624(lines 624 626) no Hoare annotation was computed. [2021-10-11 00:33:10,016 INFO L258 CegarLoopResult]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse27 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base)) (.cse25 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset)) (.cse26 (+ ULTIMATE.start_main_~len~0 ULTIMATE.start_main_~i~0)) (.cse24 (+ ULTIMATE.start_main_~i~0 2))) (let ((.cse12 (<= ULTIMATE.start_main_~len~0 .cse24)) (.cse0 (<= (+ ULTIMATE.start_sll_update_at_~index 2) ULTIMATE.start_main_~len~0)) (.cse23 (select (select |#memory_int| ULTIMATE.start_sll_get_data_at_~head.base) ULTIMATE.start_sll_get_data_at_~head.offset)) (.cse22 (<= ULTIMATE.start_sll_get_data_at_~index 0)) (.cse1 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (.cse11 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse2 (= 2 ULTIMATE.start_main_~len~0)) (.cse13 (<= ULTIMATE.start_main_~len~0 ULTIMATE.start_sll_update_at_~data)) (.cse14 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0)) (.cse15 (<= (+ .cse25 1) .cse26)) (.cse3 (= ULTIMATE.start_main_~s~0.offset ULTIMATE.start_sll_update_at_~head.offset)) (.cse4 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse5 (not (= ULTIMATE.start_main_~s~0.base (select .cse27 4)))) (.cse6 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse7 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse8 (<= (+ ULTIMATE.start_sll_update_at_~data 2) (* 2 ULTIMATE.start_main_~len~0))) (.cse9 (<= ULTIMATE.start_main_~len~0 .cse25)) (.cse17 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse18 (= (* ULTIMATE.start_main_~len~0 2) (+ (let ((.cse28 (+ ULTIMATE.start_main_~s~0.offset 4))) (select (select |#memory_int| (select .cse27 .cse28)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) .cse28))) 1))) (.cse19 (= (mod (+ ULTIMATE.start_main_~expected~0 1) 2) 0)) (.cse20 (= ULTIMATE.start_main_~s~0.offset 0))) (or (let ((.cse21 (+ ULTIMATE.start_sll_get_data_at_~head.offset 4))) (let ((.cse10 (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_get_data_at_~head.base) .cse21))) (let ((.cse16 (select (select |#memory_int| .cse10) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_sll_get_data_at_~head.base) .cse21)))) (and .cse0 .cse1 .cse2 (<= 1 ULTIMATE.start_sll_get_data_at_~index) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ULTIMATE.start_sll_get_data_at_~head.base .cse10)) (<= ULTIMATE.start_sll_get_data_at_~index 1) .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_main_~expected~0 .cse16) .cse17 .cse18 .cse19 .cse20 (<= .cse16 ULTIMATE.start_main_~expected~0) (= ULTIMATE.start_sll_get_data_at_~head.offset 0))))) (and (<= ULTIMATE.start_main_~expected~0 2) (<= 2 ULTIMATE.start_main_~expected~0) .cse22 .cse1 .cse11 .cse12 .cse2 .cse13 .cse3 .cse4 .cse6 .cse7 (<= .cse23 2) .cse8 .cse9 .cse17 (<= 2 .cse23) (<= ULTIMATE.start_sll_update_at_~index ULTIMATE.start_main_~i~0) (<= .cse24 ULTIMATE.start_main_~len~0) (<= .cse25 .cse26)) (and .cse0 (= (+ (* (div (+ ULTIMATE.start_main_~expected~0 (- 1)) 2) 2) 1) .cse23) .cse22 .cse1 .cse11 .cse2 .cse13 .cse14 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse19 .cse20)))) [2021-10-11 00:33:10,016 INFO L262 CegarLoopResult]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2021-10-11 00:33:10,016 INFO L258 CegarLoopResult]: At program point L625(lines 613 632) the Hoare annotation is: false [2021-10-11 00:33:10,016 INFO L262 CegarLoopResult]: For program point L592(lines 592 598) no Hoare annotation was computed. [2021-10-11 00:33:10,016 INFO L262 CegarLoopResult]: For program point L576(lines 576 578) no Hoare annotation was computed. [2021-10-11 00:33:10,017 INFO L262 CegarLoopResult]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2021-10-11 00:33:10,017 INFO L265 CegarLoopResult]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2021-10-11 00:33:10,017 INFO L258 CegarLoopResult]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base))) (let ((.cse18 (select .cse12 4))) (let ((.cse4 (not (= ULTIMATE.start_main_~s~0.base .cse18))) (.cse0 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse1 (= 2 ULTIMATE.start_main_~len~0)) (.cse3 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse10 (* 2 ULTIMATE.start_main_~len~0)) (.cse5 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse6 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse2 (+ ULTIMATE.start_main_~i~0 1)) (.cse7 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse11 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (.cse8 (= ULTIMATE.start_main_~s~0.offset 0)) (.cse15 (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0)) (.cse14 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base))) (or (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res.base|) 4) |ULTIMATE.start_sll_create_#res.base|)) (= ULTIMATE.start_sll_create_~head~0.offset 0) .cse0 .cse1 (<= .cse2 ULTIMATE.start_main_~len~0) (= |ULTIMATE.start_sll_create_#res.offset| 0) .cse3 .cse4 .cse5 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_create_~head~0.base) 4) ULTIMATE.start_sll_create_~head~0.base)) .cse6 .cse7 .cse8 (< 0 ULTIMATE.start_main_~i~0)) (let ((.cse9 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset))) (and (<= (+ ULTIMATE.start_sll_update_at_~index 2) ULTIMATE.start_main_~len~0) (<= (+ .cse9 2) .cse10) .cse11 .cse0 (<= ULTIMATE.start_main_~len~0 ULTIMATE.start_sll_update_at_~data) .cse1 (= ULTIMATE.start_main_~s~0.offset ULTIMATE.start_sll_update_at_~head.offset) .cse3 .cse4 .cse5 .cse6 (<= (+ ULTIMATE.start_sll_update_at_~data 2) .cse10) (<= ULTIMATE.start_main_~len~0 .cse9) .cse7 (= (* ULTIMATE.start_main_~len~0 2) (+ (let ((.cse13 (+ ULTIMATE.start_main_~s~0.offset 4))) (select (select |#memory_int| (select .cse12 .cse13)) (select .cse14 .cse13))) 1)) .cse8 .cse15)) (let ((.cse19 (select .cse14 4))) (let ((.cse16 (+ ULTIMATE.start_sll_update_at_~data 1)) (.cse17 (+ (select (select |#memory_int| .cse18) .cse19) 1))) (and (<= .cse16 .cse10) .cse0 (<= .cse10 .cse16) .cse1 (<= .cse10 .cse17) .cse3 (<= .cse17 .cse10) .cse5 .cse6 (< 0 .cse2) .cse7 (not .cse11) (= ULTIMATE.start_sll_update_at_~head.base .cse18) .cse8 (= .cse19 ULTIMATE.start_sll_update_at_~head.offset) (<= ULTIMATE.start_sll_update_at_~index ULTIMATE.start_main_~i~0) .cse15))))))) [2021-10-11 00:33:10,017 INFO L262 CegarLoopResult]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2021-10-11 00:33:10,017 INFO L262 CegarLoopResult]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2021-10-11 00:33:10,017 INFO L258 CegarLoopResult]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse1 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse2 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse4 (= ULTIMATE.start_node_create_~temp~0.offset 0)) (.cse5 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse0 (= 2 ULTIMATE.start_main_~len~0))) (or (and (= 2 ULTIMATE.start_sll_create_~len) .cse0) (and .cse1 (<= 1 ULTIMATE.start_sll_create_~len) .cse2 .cse3 .cse4 .cse5 .cse0) (and .cse1 (= ULTIMATE.start_sll_create_~head~0.offset 0) .cse2 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_sll_create_~head~0.base) 4) ULTIMATE.start_sll_create_~head~0.base)) .cse3 .cse4 .cse5 .cse0))) [2021-10-11 00:33:10,017 INFO L262 CegarLoopResult]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2021-10-11 00:33:10,017 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-11 00:33:10,018 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2021-10-11 00:33:10,018 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 00:33:10,018 INFO L258 CegarLoopResult]: At program point L604(lines 599 605) the Hoare annotation is: (and (<= ULTIMATE.start_sll_get_data_at_~index 0) (let ((.cse11 (select (select |#memory_int| ULTIMATE.start_main_~s~0.base) ULTIMATE.start_main_~s~0.offset))) (let ((.cse7 (select (select |#memory_int| ULTIMATE.start_sll_get_data_at_~head.base) ULTIMATE.start_sll_get_data_at_~head.offset)) (.cse0 (= ULTIMATE.start_main_~s~0.base ULTIMATE.start_sll_update_at_~head.base)) (.cse1 (= (select |#valid| ULTIMATE.start_sll_create_~head~0.base) 1)) (.cse2 (<= ULTIMATE.start_main_~len~0 ULTIMATE.start_sll_update_at_~data)) (.cse12 (+ ULTIMATE.start_main_~len~0 ULTIMATE.start_main_~i~0)) (.cse3 (= ULTIMATE.start_main_~s~0.offset ULTIMATE.start_sll_update_at_~head.offset)) (.cse4 (= (select |#valid| ULTIMATE.start_node_create_~temp~0.base) 1)) (.cse5 (= |ULTIMATE.start_node_create_#res.offset| 0)) (.cse6 (= (select |#valid| |ULTIMATE.start_node_create_#res.base|) 1)) (.cse8 (<= (+ ULTIMATE.start_sll_update_at_~data 2) (* 2 ULTIMATE.start_main_~len~0))) (.cse9 (<= ULTIMATE.start_main_~len~0 .cse11)) (.cse10 (= ULTIMATE.start_node_create_~temp~0.offset 0))) (or (and (<= ULTIMATE.start_main_~expected~0 2) (<= 2 ULTIMATE.start_main_~expected~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 |ULTIMATE.start_sll_get_data_at_#res|) .cse5 .cse6 (<= .cse7 2) .cse8 .cse9 .cse10 (<= 2 .cse7) (<= ULTIMATE.start_sll_update_at_~index ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (<= .cse11 .cse12) (<= |ULTIMATE.start_sll_get_data_at_#res| 2)) (let ((.cse14 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~s~0.base)) (.cse13 (+ (* (div (+ ULTIMATE.start_main_~expected~0 (- 1)) 2) 2) 1))) (and (<= (+ ULTIMATE.start_sll_update_at_~index 2) ULTIMATE.start_main_~len~0) (= .cse13 .cse7) .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= (+ .cse11 1) .cse12) .cse3 .cse4 (not (= ULTIMATE.start_main_~s~0.base (select .cse14 4))) .cse5 .cse6 .cse8 .cse9 .cse10 (= (* ULTIMATE.start_main_~len~0 2) (+ (let ((.cse15 (+ ULTIMATE.start_main_~s~0.offset 4))) (select (select |#memory_int| (select .cse14 .cse15)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~s~0.base) .cse15))) 1)) (= (mod (+ ULTIMATE.start_main_~expected~0 1) 2) 0) (= ULTIMATE.start_main_~s~0.offset 0) (= .cse13 |ULTIMATE.start_sll_get_data_at_#res|)))))) (= 2 ULTIMATE.start_main_~len~0)) [2021-10-11 00:33:10,027 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,028 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,032 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,033 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,035 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,036 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,036 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,036 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,037 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,037 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,037 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,037 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,038 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,038 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,038 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,038 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,041 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,041 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,041 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,042 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,042 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,042 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,042 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,043 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,043 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,043 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,043 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,043 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,046 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,047 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,047 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,047 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,048 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,048 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,048 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,048 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,049 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,049 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,051 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,051 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,052 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,052 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,052 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,052 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,053 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,053 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,053 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,053 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,057 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,057 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,057 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,059 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,060 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,060 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,062 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,063 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,064 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,065 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,065 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,065 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,065 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,066 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,066 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,066 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,067 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,067 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,067 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,080 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,080 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,080 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,081 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,081 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,081 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,081 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,083 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,083 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,083 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,083 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,086 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,086 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,086 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,087 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,088 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,088 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:33:10 BoogieIcfgContainer [2021-10-11 00:33:10,091 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 00:33:10,092 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:33:10,092 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:33:10,092 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:33:10,095 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:32:57" (3/4) ... [2021-10-11 00:33:10,099 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 00:33:10,116 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-10-11 00:33:10,116 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-10-11 00:33:10,116 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 00:33:10,117 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 00:33:10,144 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((2 == len && 2 == len) || ((((((\valid[temp] == 1 && 1 <= len) && \result == 0) && \valid[\result] == 1) && temp == 0) && \valid[head] == 1) && 2 == len)) || (((((((\valid[temp] == 1 && head == 0) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && temp == 0) && \valid[head] == 1) && 2 == len) [2021-10-11 00:33:10,145 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\valid[temp] == 1 && !(#memory_$Pointer$[\result][4] == \result)) && head == 0) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && temp == 0) && \valid[head] == 1) && 2 == len) && \result == 0 [2021-10-11 00:33:10,145 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(#memory_$Pointer$[\result][4] == \result) && head == 0) && \valid[head] == 1) && 2 == len) && i + 1 <= len) && \result == 0) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && temp == 0) && s == 0) && 0 < i) || ((((((((((((((((index + 2 <= len && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && s == head) && \valid[head] == 1) && len <= data) && 2 == len) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && s == 0) && i + 2 <= len)) || ((((((((((((((((data + 1 <= 2 * len && \valid[head] == 1) && 2 * len <= data + 1) && 2 == len) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1) && \valid[temp] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1 <= 2 * len) && \result == 0) && \valid[\result] == 1) && 0 < i + 1) && temp == 0) && !(s == head)) && head == #memory_$Pointer$[s][4]) && s == 0) && #memory_$Pointer$[s][4] == head) && index <= i) && i + 2 <= len) [2021-10-11 00:33:10,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((index + 2 <= len && s == head) && \valid[head] == 1) && 2 == len) && len <= data) && i + 1 <= len) && unknown-#memory_int-unknown[s][s] + 1 <= len + i) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && s == 0) || ((((((((((((((index + 2 <= len && index <= 0) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && s == head) && \valid[head] == 1) && len <= data) && 2 == len) && s == head) && \valid[temp] == 1) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && i + 2 <= len) [2021-10-11 00:33:10,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\valid[temp] == 1 && \result == 0) && \valid[\result] == 1) && 2 == len) && temp == 0) && 2 == len) || ((((((((\valid[temp] == 1 && 1 <= len) && !(head == temp)) && \result == 0) && \valid[\result] == 1) && temp == 0) && \valid[head] == 1) && !(\result == head)) && 2 == len) [2021-10-11 00:33:10,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(#memory_$Pointer$[\result][4] == \result) && head == 0) && index + 2 <= len) && data + 1 <= 2 * len) && \valid[head] == 1) && 2 * len <= data + 1) && 2 == len) && i + 1 <= len) && \result == 0) && \valid[temp] == 1) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && temp == 0) && !(s == head)) && head == #memory_$Pointer$[s][4]) && s == 0) && #memory_$Pointer$[s][4] == head) && 0 < i) || (((((((((((((((s == head && \valid[head] == 1) && len <= data) && 2 == len) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && 0 < i + 1) && data + 2 <= 2 * len) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && s == 0) && index <= i) && i + 2 <= len)) || ((((((((((((((((((!(#memory_$Pointer$[\result][4] == \result) && len <= index + 1) && head == 0) && data + 1 <= 2 * len) && s == head) && \valid[head] == 1) && 2 * len <= data + 1) && 2 == len) && i + 1 <= len) && \result == 0) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && head == 0) && temp == 0) && s == 0) && index <= i) [2021-10-11 00:33:10,147 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((index + 2 <= len && s == head) && 2 == len) && 1 <= index) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && !(head == #memory_$Pointer$[head][head + 4])) && index <= 1) && \valid[head] == 1) && len <= i + 2) && len <= data) && i + 1 <= len) && unknown-#memory_int-unknown[s][s] + 1 <= len + i) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && (expected + 1) % 2 == 0) && s == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] <= expected) && head == 0) || (((((((((((((((((((expected <= 2 && 2 <= expected) && index <= 0) && s == head) && \valid[head] == 1) && len <= i + 2) && 2 == len) && len <= data) && s == head) && \valid[temp] == 1) && \result == 0) && \valid[\result] == 1) && unknown-#memory_int-unknown[head][head] <= 2) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && 2 <= unknown-#memory_int-unknown[head][head]) && index <= i) && i + 2 <= len) && unknown-#memory_int-unknown[s][s] <= len + i)) || (((((((((((((((((((index + 2 <= len && (expected + -1) / 2 * 2 + 1 == unknown-#memory_int-unknown[head][head]) && index <= 0) && s == head) && \valid[head] == 1) && 2 == len) && len <= data) && i + 1 <= len) && unknown-#memory_int-unknown[s][s] + 1 <= len + i) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && (expected + 1) % 2 == 0) && s == 0) [2021-10-11 00:33:10,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (index <= 0 && (((((((((((((((((((expected <= 2 && 2 <= expected) && s == head) && \valid[head] == 1) && len <= data) && s == head) && \valid[temp] == 1) && 2 <= \result) && \result == 0) && \valid[\result] == 1) && unknown-#memory_int-unknown[head][head] <= 2) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && 2 <= unknown-#memory_int-unknown[head][head]) && index <= i) && i + 2 <= len) && unknown-#memory_int-unknown[s][s] <= len + i) && \result <= 2) || ((((((((((((((((((index + 2 <= len && (expected + -1) / 2 * 2 + 1 == unknown-#memory_int-unknown[head][head]) && s == head) && \valid[head] == 1) && len <= data) && i + 1 <= len) && unknown-#memory_int-unknown[s][s] + 1 <= len + i) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && (expected + 1) % 2 == 0) && s == 0) && (expected + -1) / 2 * 2 + 1 == \result))) && 2 == len [2021-10-11 00:33:10,184 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80bbdd0c-cdf8-4c2e-a056-44859190142c/bin/uautomizer-Z5i5R5N3CC/witness.graphml [2021-10-11 00:33:10,184 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:33:10,185 INFO L168 Benchmark]: Toolchain (without parser) took 14039.67 ms. Allocated memory was 132.1 MB in the beginning and 199.2 MB in the end (delta: 67.1 MB). Free memory was 98.0 MB in the beginning and 95.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 69.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:10,186 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 90.2 MB. Free memory was 44.9 MB in the beginning and 44.8 MB in the end (delta: 77.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:33:10,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 496.94 ms. Allocated memory is still 132.1 MB. Free memory was 97.8 MB in the beginning and 93.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:10,186 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.85 ms. Allocated memory is still 132.1 MB. Free memory was 92.9 MB in the beginning and 90.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:10,187 INFO L168 Benchmark]: Boogie Preprocessor took 45.25 ms. Allocated memory is still 132.1 MB. Free memory was 90.8 MB in the beginning and 89.2 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:33:10,188 INFO L168 Benchmark]: RCFGBuilder took 526.43 ms. Allocated memory is still 132.1 MB. Free memory was 89.2 MB in the beginning and 67.2 MB in the end (delta: 22.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:10,188 INFO L168 Benchmark]: TraceAbstraction took 12818.11 ms. Allocated memory was 132.1 MB in the beginning and 199.2 MB in the end (delta: 67.1 MB). Free memory was 66.7 MB in the beginning and 98.6 MB in the end (delta: -31.9 MB). Peak memory consumption was 82.3 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:10,189 INFO L168 Benchmark]: Witness Printer took 92.39 ms. Allocated memory is still 199.2 MB. Free memory was 98.6 MB in the beginning and 95.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:10,194 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 90.2 MB. Free memory was 44.9 MB in the beginning and 44.8 MB in the end (delta: 77.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 496.94 ms. Allocated memory is still 132.1 MB. Free memory was 97.8 MB in the beginning and 93.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 44.85 ms. Allocated memory is still 132.1 MB. Free memory was 92.9 MB in the beginning and 90.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 45.25 ms. Allocated memory is still 132.1 MB. Free memory was 90.8 MB in the beginning and 89.2 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 526.43 ms. Allocated memory is still 132.1 MB. Free memory was 89.2 MB in the beginning and 67.2 MB in the end (delta: 22.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 12818.11 ms. Allocated memory was 132.1 MB in the beginning and 199.2 MB in the end (delta: 67.1 MB). Free memory was 66.7 MB in the beginning and 98.6 MB in the end (delta: -31.9 MB). Peak memory consumption was 82.3 MB. Max. memory is 16.1 GB. * Witness Printer took 92.39 ms. Allocated memory is still 199.2 MB. Free memory was 98.6 MB in the beginning and 95.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant [2021-10-11 00:33:10,209 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,210 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,210 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,210 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((\valid[temp] == 1 && !(#memory_$Pointer$[\result][4] == \result)) && head == 0) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && temp == 0) && \valid[head] == 1) && 2 == len) && \result == 0 - InvariantResult [Line: 618]: Loop Invariant [2021-10-11 00:33:10,211 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,211 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,211 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,211 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,211 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,212 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,212 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,212 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,212 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,212 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,213 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,213 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,214 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,214 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,214 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,214 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,214 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,215 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,215 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,215 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,215 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,215 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,215 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,216 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((!(#memory_$Pointer$[\result][4] == \result) && head == 0) && \valid[head] == 1) && 2 == len) && i + 1 <= len) && \result == 0) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && temp == 0) && s == 0) && 0 < i) || ((((((((((((((((index + 2 <= len && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && s == head) && \valid[head] == 1) && len <= data) && 2 == len) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && s == 0) && i + 2 <= len)) || ((((((((((((((((data + 1 <= 2 * len && \valid[head] == 1) && 2 * len <= data + 1) && 2 == len) && 2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1) && \valid[temp] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1 <= 2 * len) && \result == 0) && \valid[\result] == 1) && 0 < i + 1) && temp == 0) && !(s == head)) && head == #memory_$Pointer$[s][4]) && s == 0) && #memory_$Pointer$[s][4] == head) && index <= i) && i + 2 <= len) - InvariantResult [Line: 607]: Loop Invariant [2021-10-11 00:33:10,217 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,217 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,217 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,217 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,217 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,218 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,218 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,218 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,218 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,218 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,219 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,220 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,220 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,220 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,220 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,220 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,220 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,221 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,221 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,221 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((!(#memory_$Pointer$[\result][4] == \result) && head == 0) && index + 2 <= len) && data + 1 <= 2 * len) && \valid[head] == 1) && 2 * len <= data + 1) && 2 == len) && i + 1 <= len) && \result == 0) && \valid[temp] == 1) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && temp == 0) && !(s == head)) && head == #memory_$Pointer$[s][4]) && s == 0) && #memory_$Pointer$[s][4] == head) && 0 < i) || (((((((((((((((s == head && \valid[head] == 1) && len <= data) && 2 == len) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && 0 < i + 1) && data + 2 <= 2 * len) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && s == 0) && index <= i) && i + 2 <= len)) || ((((((((((((((((((!(#memory_$Pointer$[\result][4] == \result) && len <= index + 1) && head == 0) && data + 1 <= 2 * len) && s == head) && \valid[head] == 1) && 2 * len <= data + 1) && 2 == len) && i + 1 <= len) && \result == 0) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && head == 0) && temp == 0) && s == 0) && index <= i) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 599]: Loop Invariant [2021-10-11 00:33:10,222 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,222 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,223 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,224 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,224 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,224 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (index <= 0 && (((((((((((((((((((expected <= 2 && 2 <= expected) && s == head) && \valid[head] == 1) && len <= data) && s == head) && \valid[temp] == 1) && 2 <= \result) && \result == 0) && \valid[\result] == 1) && unknown-#memory_int-unknown[head][head] <= 2) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && 2 <= unknown-#memory_int-unknown[head][head]) && index <= i) && i + 2 <= len) && unknown-#memory_int-unknown[s][s] <= len + i) && \result <= 2) || ((((((((((((((((((index + 2 <= len && (expected + -1) / 2 * 2 + 1 == unknown-#memory_int-unknown[head][head]) && s == head) && \valid[head] == 1) && len <= data) && i + 1 <= len) && unknown-#memory_int-unknown[s][s] + 1 <= len + i) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && (expected + 1) % 2 == 0) && s == 0) && (expected + -1) / 2 * 2 + 1 == \result))) && 2 == len - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 585]: Loop Invariant [2021-10-11 00:33:10,225 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,226 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((2 == len && 2 == len) || ((((((\valid[temp] == 1 && 1 <= len) && \result == 0) && \valid[\result] == 1) && temp == 0) && \valid[head] == 1) && 2 == len)) || (((((((\valid[temp] == 1 && head == 0) && \result == 0) && !(#memory_$Pointer$[head][4] == head)) && \valid[\result] == 1) && temp == 0) && \valid[head] == 1) && 2 == len) - InvariantResult [Line: 600]: Loop Invariant [2021-10-11 00:33:10,226 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,226 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,226 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,227 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,227 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,227 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,227 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,227 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,228 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,228 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,228 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,229 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,229 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,230 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,230 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,230 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,230 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,230 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,230 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((index + 2 <= len && s == head) && 2 == len) && 1 <= index) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && !(head == #memory_$Pointer$[head][head + 4])) && index <= 1) && \valid[head] == 1) && len <= i + 2) && len <= data) && i + 1 <= len) && unknown-#memory_int-unknown[s][s] + 1 <= len + i) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && (expected + 1) % 2 == 0) && s == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] <= expected) && head == 0) || (((((((((((((((((((expected <= 2 && 2 <= expected) && index <= 0) && s == head) && \valid[head] == 1) && len <= i + 2) && 2 == len) && len <= data) && s == head) && \valid[temp] == 1) && \result == 0) && \valid[\result] == 1) && unknown-#memory_int-unknown[head][head] <= 2) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && 2 <= unknown-#memory_int-unknown[head][head]) && index <= i) && i + 2 <= len) && unknown-#memory_int-unknown[s][s] <= len + i)) || (((((((((((((((((((index + 2 <= len && (expected + -1) / 2 * 2 + 1 == unknown-#memory_int-unknown[head][head]) && index <= 0) && s == head) && \valid[head] == 1) && 2 == len) && len <= data) && i + 1 <= len) && unknown-#memory_int-unknown[s][s] + 1 <= len + i) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && (expected + 1) % 2 == 0) && s == 0) - InvariantResult [Line: 622]: Loop Invariant [2021-10-11 00:33:10,233 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,233 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,233 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-10-11 00:33:10,234 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,234 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-10-11 00:33:10,234 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((index + 2 <= len && s == head) && \valid[head] == 1) && 2 == len) && len <= data) && i + 1 <= len) && unknown-#memory_int-unknown[s][s] + 1 <= len + i) && s == head) && \valid[temp] == 1) && !(s == #memory_$Pointer$[s][4])) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && s == 0) || ((((((((((((((index + 2 <= len && index <= 0) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && s == head) && \valid[head] == 1) && len <= data) && 2 == len) && s == head) && \valid[temp] == 1) && \result == 0) && \valid[\result] == 1) && data + 2 <= 2 * len) && len <= unknown-#memory_int-unknown[s][s]) && temp == 0) && i + 2 <= len) - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: (((((\valid[temp] == 1 && \result == 0) && \valid[\result] == 1) && 2 == len) && temp == 0) && 2 == len) || ((((((((\valid[temp] == 1 && 1 <= len) && !(head == temp)) && \result == 0) && \valid[\result] == 1) && temp == 0) && \valid[head] == 1) && !(\result == head)) && 2 == len) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.8s, OverallIterations: 12, TraceHistogramMax: 2, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 255 SDtfs, 716 SDslu, 769 SDs, 0 SdLazy, 1200 SolverSat, 244 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 76 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 31 NumberOfFragments, 1538 HoareAnnotationTreeSize, 12 FomulaSimplifications, 7287 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 544 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 526 NumberOfCodeBlocks, 526 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 508 ConstructedInterpolants, 0 QuantifiedInterpolants, 108674 SizeOfPredicates, 78 NumberOfNonLiveVariables, 1257 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 172/232 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...