./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP --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 64bit --witnessprinter.graph.data.programhash f91d2143e2aa98b5d48c7de2c4b17a3507ecfb748f26bae9be6d0588f4557bb1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:08:34,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:08:34,195 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-06 22:08:34,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:08:34,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:08:34,233 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:08:34,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:08:34,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:08:34,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:08:34,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:08:34,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:08:34,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:08:34,243 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:08:34,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:08:34,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:08:34,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:08:34,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:08:34,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:08:34,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:08:34,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:08:34,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:08:34,248 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:08:34,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:08:34,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:08:34,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:08:34,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:08:34,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:08:34,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:08:34,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:08:34,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:08:34,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:08:34,254 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:08:34,255 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:08:34,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:08:34,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:08:34,255 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:08:34,256 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/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_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f91d2143e2aa98b5d48c7de2c4b17a3507ecfb748f26bae9be6d0588f4557bb1 [2023-11-06 22:08:34,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:08:34,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:08:34,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:08:34,626 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:08:34,627 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:08:34,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2023-11-06 22:08:37,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:08:38,341 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:08:38,341 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2023-11-06 22:08:38,374 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/data/b5ed1a602/8af45288f7ee43918e153a0671ee513f/FLAG505c6546d [2023-11-06 22:08:38,396 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/data/b5ed1a602/8af45288f7ee43918e153a0671ee513f [2023-11-06 22:08:38,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:08:38,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:08:38,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:08:38,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:08:38,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:08:38,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:08:38" (1/1) ... [2023-11-06 22:08:38,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f676c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:38, skipping insertion in model container [2023-11-06 22:08:38,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:08:38" (1/1) ... [2023-11-06 22:08:38,551 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:08:39,433 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i[183784,183797] [2023-11-06 22:08:39,484 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:08:39,519 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:08:39,842 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6057] [2023-11-06 22:08:39,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6060] [2023-11-06 22:08:39,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6063] [2023-11-06 22:08:39,846 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6066] [2023-11-06 22:08:39,846 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6069] [2023-11-06 22:08:39,873 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i[183784,183797] [2023-11-06 22:08:39,891 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:08:39,948 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:08:39,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:39 WrapperNode [2023-11-06 22:08:39,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:08:39,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:08:39,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:08:39,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:08:39,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:39" (1/1) ... [2023-11-06 22:08:40,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:39" (1/1) ... [2023-11-06 22:08:40,073 INFO L138 Inliner]: procedures = 68, calls = 171, calls flagged for inlining = 23, calls inlined = 16, statements flattened = 356 [2023-11-06 22:08:40,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:08:40,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:08:40,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:08:40,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:08:40,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:39" (1/1) ... [2023-11-06 22:08:40,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:39" (1/1) ... [2023-11-06 22:08:40,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:39" (1/1) ... [2023-11-06 22:08:40,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:39" (1/1) ... [2023-11-06 22:08:40,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:39" (1/1) ... [2023-11-06 22:08:40,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:39" (1/1) ... [2023-11-06 22:08:40,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:39" (1/1) ... [2023-11-06 22:08:40,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:39" (1/1) ... [2023-11-06 22:08:40,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:08:40,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:08:40,195 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:08:40,195 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:08:40,196 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:39" (1/1) ... [2023-11-06 22:08:40,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:08:40,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:40,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:08:40,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:08:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:08:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:08:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-06 22:08:40,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-06 22:08:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:08:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-06 22:08:40,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-06 22:08:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:08:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2023-11-06 22:08:40,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2023-11-06 22:08:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:08:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:08:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-06 22:08:40,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-06 22:08:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2023-11-06 22:08:40,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2023-11-06 22:08:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:08:40,302 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:08:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:08:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:08:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:08:40,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:08:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2023-11-06 22:08:40,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2023-11-06 22:08:40,631 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:08:40,635 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:08:40,722 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-06 22:08:41,065 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:08:41,073 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:08:41,074 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:08:41,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:08:41 BoogieIcfgContainer [2023-11-06 22:08:41,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:08:41,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:08:41,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:08:41,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:08:41,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:08:38" (1/3) ... [2023-11-06 22:08:41,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7affb175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:08:41, skipping insertion in model container [2023-11-06 22:08:41,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:39" (2/3) ... [2023-11-06 22:08:41,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7affb175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:08:41, skipping insertion in model container [2023-11-06 22:08:41,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:08:41" (3/3) ... [2023-11-06 22:08:41,086 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point.cil.out.i [2023-11-06 22:08:41,105 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:08:41,105 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:08:41,161 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:08:41,168 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@224bcc7e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:08:41,169 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:08:41,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 78 states have internal predecessors, (100), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:08:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-06 22:08:41,186 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:41,187 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:41,187 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:41,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:41,193 INFO L85 PathProgramCache]: Analyzing trace with hash 248966334, now seen corresponding path program 1 times [2023-11-06 22:08:41,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:41,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706854478] [2023-11-06 22:08:41,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:41,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:41,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:08:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:41,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:41,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:41,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:08:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:41,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:41,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:41,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:08:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:41,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:08:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 22:08:41,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:41,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706854478] [2023-11-06 22:08:41,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706854478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:41,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:41,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:08:41,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991570472] [2023-11-06 22:08:41,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:41,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:08:41,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:41,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:08:41,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:08:41,912 INFO L87 Difference]: Start difference. First operand has 92 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 78 states have internal predecessors, (100), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:08:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:42,073 INFO L93 Difference]: Finished difference Result 183 states and 247 transitions. [2023-11-06 22:08:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:08:42,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2023-11-06 22:08:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:42,086 INFO L225 Difference]: With dead ends: 183 [2023-11-06 22:08:42,087 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 22:08:42,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:08:42,094 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 50 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:42,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 176 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:42,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 22:08:42,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2023-11-06 22:08:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 67 states have (on average 1.328358208955224) internal successors, (89), 68 states have internal predecessors, (89), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-06 22:08:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2023-11-06 22:08:42,145 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 61 [2023-11-06 22:08:42,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:42,146 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2023-11-06 22:08:42,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:08:42,146 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2023-11-06 22:08:42,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-06 22:08:42,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:42,150 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:42,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:08:42,150 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:42,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:42,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1818870074, now seen corresponding path program 1 times [2023-11-06 22:08:42,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:42,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585433976] [2023-11-06 22:08:42,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:42,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:42,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:08:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:42,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:42,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:42,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:08:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:42,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:42,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:08:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:42,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:08:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 22:08:42,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:42,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585433976] [2023-11-06 22:08:42,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585433976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:42,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:42,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:08:42,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243457334] [2023-11-06 22:08:42,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:42,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:08:42,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:42,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:08:42,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:08:42,666 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:08:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:42,969 INFO L93 Difference]: Finished difference Result 182 states and 246 transitions. [2023-11-06 22:08:42,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:08:42,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2023-11-06 22:08:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:42,972 INFO L225 Difference]: With dead ends: 182 [2023-11-06 22:08:42,972 INFO L226 Difference]: Without dead ends: 130 [2023-11-06 22:08:42,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:08:42,975 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 100 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:42,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 287 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:08:42,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-06 22:08:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2023-11-06 22:08:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 107 states have internal predecessors, (145), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:08:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 163 transitions. [2023-11-06 22:08:42,995 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 163 transitions. Word has length 61 [2023-11-06 22:08:42,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:42,995 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 163 transitions. [2023-11-06 22:08:42,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:08:42,996 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 163 transitions. [2023-11-06 22:08:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:08:42,997 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:42,997 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:42,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:08:42,998 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:42,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:42,999 INFO L85 PathProgramCache]: Analyzing trace with hash 434801004, now seen corresponding path program 1 times [2023-11-06 22:08:42,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:42,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091989137] [2023-11-06 22:08:42,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:42,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:08:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:08:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:08:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:08:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 22:08:43,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:43,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091989137] [2023-11-06 22:08:43,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091989137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:43,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:43,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:08:43,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242247113] [2023-11-06 22:08:43,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:43,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:08:43,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:43,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:08:43,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:08:43,293 INFO L87 Difference]: Start difference. First operand 123 states and 163 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:08:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:43,504 INFO L93 Difference]: Finished difference Result 137 states and 177 transitions. [2023-11-06 22:08:43,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:08:43,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2023-11-06 22:08:43,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:43,511 INFO L225 Difference]: With dead ends: 137 [2023-11-06 22:08:43,512 INFO L226 Difference]: Without dead ends: 132 [2023-11-06 22:08:43,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:08:43,516 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 131 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:43,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 230 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:43,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-06 22:08:43,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2023-11-06 22:08:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 107 states have internal predecessors, (144), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:08:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 162 transitions. [2023-11-06 22:08:43,559 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 162 transitions. Word has length 64 [2023-11-06 22:08:43,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:43,561 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 162 transitions. [2023-11-06 22:08:43,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:08:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 162 transitions. [2023-11-06 22:08:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:08:43,568 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:43,568 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:43,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:08:43,571 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:43,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash 492059306, now seen corresponding path program 1 times [2023-11-06 22:08:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:43,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110968646] [2023-11-06 22:08:43,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:43,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:08:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:08:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:08:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:08:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 22:08:43,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:43,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110968646] [2023-11-06 22:08:43,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110968646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:43,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:43,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:08:43,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445905814] [2023-11-06 22:08:43,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:43,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:08:43,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:43,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:08:43,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:08:43,893 INFO L87 Difference]: Start difference. First operand 123 states and 162 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:08:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:44,073 INFO L93 Difference]: Finished difference Result 310 states and 425 transitions. [2023-11-06 22:08:44,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:08:44,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 64 [2023-11-06 22:08:44,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:44,076 INFO L225 Difference]: With dead ends: 310 [2023-11-06 22:08:44,076 INFO L226 Difference]: Without dead ends: 213 [2023-11-06 22:08:44,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:08:44,079 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 142 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:44,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 216 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:44,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-11-06 22:08:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2023-11-06 22:08:44,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 184 states have (on average 1.3858695652173914) internal successors, (255), 185 states have internal predecessors, (255), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 22:08:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 277 transitions. [2023-11-06 22:08:44,106 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 277 transitions. Word has length 64 [2023-11-06 22:08:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:44,106 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 277 transitions. [2023-11-06 22:08:44,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:08:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 277 transitions. [2023-11-06 22:08:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-06 22:08:44,109 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:44,109 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:44,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:08:44,110 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:44,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:44,110 INFO L85 PathProgramCache]: Analyzing trace with hash -397558625, now seen corresponding path program 1 times [2023-11-06 22:08:44,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:44,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234073858] [2023-11-06 22:08:44,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:44,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:08:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:08:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:08:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:08:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 22:08:44,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:44,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234073858] [2023-11-06 22:08:44,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234073858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:44,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:44,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:08:44,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642549792] [2023-11-06 22:08:44,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:44,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:08:44,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:44,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:08:44,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:08:44,371 INFO L87 Difference]: Start difference. First operand 205 states and 277 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:08:44,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:44,577 INFO L93 Difference]: Finished difference Result 451 states and 621 transitions. [2023-11-06 22:08:44,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:08:44,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 70 [2023-11-06 22:08:44,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:44,580 INFO L225 Difference]: With dead ends: 451 [2023-11-06 22:08:44,580 INFO L226 Difference]: Without dead ends: 276 [2023-11-06 22:08:44,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:08:44,585 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 93 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:44,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 381 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:44,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-11-06 22:08:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 265. [2023-11-06 22:08:44,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 244 states have (on average 1.389344262295082) internal successors, (339), 245 states have internal predecessors, (339), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 22:08:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 361 transitions. [2023-11-06 22:08:44,639 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 361 transitions. Word has length 70 [2023-11-06 22:08:44,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:44,639 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 361 transitions. [2023-11-06 22:08:44,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:08:44,639 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 361 transitions. [2023-11-06 22:08:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-06 22:08:44,641 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:44,641 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:44,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:08:44,641 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:44,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:44,642 INFO L85 PathProgramCache]: Analyzing trace with hash -620977267, now seen corresponding path program 1 times [2023-11-06 22:08:44,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:44,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679054761] [2023-11-06 22:08:44,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:44,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:45,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:08:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:45,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:45,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:45,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:08:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:45,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:45,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:45,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:08:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:08:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:45,279 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:08:45,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:45,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679054761] [2023-11-06 22:08:45,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679054761] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:08:45,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79197386] [2023-11-06 22:08:45,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:45,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:45,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:45,284 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:08:45,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:08:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:45,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:08:45,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:08:45,653 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:08:45,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79197386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:45,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:08:45,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2023-11-06 22:08:45,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68566921] [2023-11-06 22:08:45,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:45,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:08:45,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:45,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:08:45,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:08:45,655 INFO L87 Difference]: Start difference. First operand 265 states and 361 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:08:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:45,705 INFO L93 Difference]: Finished difference Result 512 states and 704 transitions. [2023-11-06 22:08:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:08:45,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 81 [2023-11-06 22:08:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:45,708 INFO L225 Difference]: With dead ends: 512 [2023-11-06 22:08:45,708 INFO L226 Difference]: Without dead ends: 266 [2023-11-06 22:08:45,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:08:45,710 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:45,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 303 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:08:45,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-11-06 22:08:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2023-11-06 22:08:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 245 states have (on average 1.3877551020408163) internal successors, (340), 246 states have internal predecessors, (340), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 22:08:45,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 362 transitions. [2023-11-06 22:08:45,733 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 362 transitions. Word has length 81 [2023-11-06 22:08:45,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:45,733 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 362 transitions. [2023-11-06 22:08:45,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:08:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 362 transitions. [2023-11-06 22:08:45,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-06 22:08:45,735 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:45,735 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:45,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:45,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:45,944 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:45,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:45,945 INFO L85 PathProgramCache]: Analyzing trace with hash -114008831, now seen corresponding path program 1 times [2023-11-06 22:08:45,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:45,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186361970] [2023-11-06 22:08:45,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:45,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:08:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:08:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:08:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:08:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:08:46,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:46,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186361970] [2023-11-06 22:08:46,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186361970] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:08:46,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391202621] [2023-11-06 22:08:46,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:46,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:46,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:46,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:08:46,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:08:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:08:46,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 22:08:46,961 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:08:46,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391202621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:46,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:08:46,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-06 22:08:46,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092864936] [2023-11-06 22:08:46,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:46,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:08:46,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:46,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:08:46,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:08:46,964 INFO L87 Difference]: Start difference. First operand 266 states and 362 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:08:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:47,049 INFO L93 Difference]: Finished difference Result 694 states and 961 transitions. [2023-11-06 22:08:47,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:08:47,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 83 [2023-11-06 22:08:47,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:47,054 INFO L225 Difference]: With dead ends: 694 [2023-11-06 22:08:47,054 INFO L226 Difference]: Without dead ends: 459 [2023-11-06 22:08:47,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:08:47,056 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 115 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:47,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 499 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:08:47,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2023-11-06 22:08:47,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 272. [2023-11-06 22:08:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 251 states have (on average 1.3705179282868525) internal successors, (344), 252 states have internal predecessors, (344), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 22:08:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 366 transitions. [2023-11-06 22:08:47,089 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 366 transitions. Word has length 83 [2023-11-06 22:08:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:47,090 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 366 transitions. [2023-11-06 22:08:47,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:08:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 366 transitions. [2023-11-06 22:08:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-06 22:08:47,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:47,092 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:47,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:47,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 22:08:47,301 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:47,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:47,301 INFO L85 PathProgramCache]: Analyzing trace with hash 566049539, now seen corresponding path program 1 times [2023-11-06 22:08:47,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:47,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719212830] [2023-11-06 22:08:47,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:47,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:08:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:08:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:08:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:08:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 22:08:47,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:47,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719212830] [2023-11-06 22:08:47,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719212830] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:08:47,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298205425] [2023-11-06 22:08:47,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:47,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:47,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:47,599 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:08:47,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:08:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:08:47,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 22:08:47,915 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:08:47,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298205425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:47,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:08:47,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-06 22:08:47,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682267580] [2023-11-06 22:08:47,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:47,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:08:47,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:47,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:08:47,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:08:47,918 INFO L87 Difference]: Start difference. First operand 272 states and 366 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:08:47,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:47,956 INFO L93 Difference]: Finished difference Result 508 states and 693 transitions. [2023-11-06 22:08:47,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:08:47,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 83 [2023-11-06 22:08:47,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:47,959 INFO L225 Difference]: With dead ends: 508 [2023-11-06 22:08:47,959 INFO L226 Difference]: Without dead ends: 267 [2023-11-06 22:08:47,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:08:47,961 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 2 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:47,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:08:47,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-11-06 22:08:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 259. [2023-11-06 22:08:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 242 states have (on average 1.3677685950413223) internal successors, (331), 243 states have internal predecessors, (331), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:08:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 349 transitions. [2023-11-06 22:08:47,985 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 349 transitions. Word has length 83 [2023-11-06 22:08:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:47,986 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 349 transitions. [2023-11-06 22:08:47,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:08:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 349 transitions. [2023-11-06 22:08:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-06 22:08:47,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:47,988 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:48,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:48,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-06 22:08:48,195 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:48,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:48,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1871889081, now seen corresponding path program 1 times [2023-11-06 22:08:48,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:48,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124960588] [2023-11-06 22:08:48,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:48,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:48,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:08:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:48,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:48,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:48,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:08:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:48,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:48,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:48,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:08:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:48,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:08:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 22:08:48,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:48,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124960588] [2023-11-06 22:08:48,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124960588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:48,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:48,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:08:48,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609140654] [2023-11-06 22:08:48,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:48,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:08:48,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:48,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:08:48,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:08:48,703 INFO L87 Difference]: Start difference. First operand 259 states and 349 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:08:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:48,947 INFO L93 Difference]: Finished difference Result 390 states and 530 transitions. [2023-11-06 22:08:48,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:08:48,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 85 [2023-11-06 22:08:48,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:48,951 INFO L225 Difference]: With dead ends: 390 [2023-11-06 22:08:48,951 INFO L226 Difference]: Without dead ends: 387 [2023-11-06 22:08:48,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:08:48,953 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 164 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:48,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 387 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:48,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2023-11-06 22:08:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 380. [2023-11-06 22:08:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 359 states have (on average 1.3816155988857939) internal successors, (496), 360 states have internal predecessors, (496), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-06 22:08:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 520 transitions. [2023-11-06 22:08:48,992 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 520 transitions. Word has length 85 [2023-11-06 22:08:48,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:48,993 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 520 transitions. [2023-11-06 22:08:48,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:08:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 520 transitions. [2023-11-06 22:08:48,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-06 22:08:48,995 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:48,995 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:48,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:08:48,995 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:48,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:48,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2097474261, now seen corresponding path program 1 times [2023-11-06 22:08:48,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:48,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221873099] [2023-11-06 22:08:48,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:48,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:08:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:08:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:08:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:08:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 22:08:49,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:49,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221873099] [2023-11-06 22:08:49,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221873099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:49,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:49,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:08:49,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448168564] [2023-11-06 22:08:49,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:49,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:08:49,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:49,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:08:49,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:08:49,204 INFO L87 Difference]: Start difference. First operand 380 states and 520 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:08:49,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:49,348 INFO L93 Difference]: Finished difference Result 640 states and 879 transitions. [2023-11-06 22:08:49,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:08:49,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2023-11-06 22:08:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:49,353 INFO L225 Difference]: With dead ends: 640 [2023-11-06 22:08:49,353 INFO L226 Difference]: Without dead ends: 388 [2023-11-06 22:08:49,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:08:49,355 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 30 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:49,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 315 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:49,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-11-06 22:08:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 380. [2023-11-06 22:08:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 359 states have (on average 1.3704735376044568) internal successors, (492), 360 states have internal predecessors, (492), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-06 22:08:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 516 transitions. [2023-11-06 22:08:49,392 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 516 transitions. Word has length 92 [2023-11-06 22:08:49,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:49,393 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 516 transitions. [2023-11-06 22:08:49,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:08:49,393 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 516 transitions. [2023-11-06 22:08:49,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-06 22:08:49,395 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:49,395 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:49,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:08:49,395 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:49,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:49,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1076405907, now seen corresponding path program 1 times [2023-11-06 22:08:49,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:49,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352969518] [2023-11-06 22:08:49,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:49,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:08:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:08:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:08:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:08:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,002 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 22:08:50,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:50,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352969518] [2023-11-06 22:08:50,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352969518] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:08:50,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698714751] [2023-11-06 22:08:50,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:50,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:50,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:50,004 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:08:50,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:08:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 22:08:50,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 22:08:50,435 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:08:50,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698714751] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:50,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:08:50,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2023-11-06 22:08:50,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7023870] [2023-11-06 22:08:50,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:50,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:08:50,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:50,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:08:50,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:08:50,438 INFO L87 Difference]: Start difference. First operand 380 states and 516 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:08:50,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:50,675 INFO L93 Difference]: Finished difference Result 1145 states and 1584 transitions. [2023-11-06 22:08:50,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:08:50,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2023-11-06 22:08:50,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:50,682 INFO L225 Difference]: With dead ends: 1145 [2023-11-06 22:08:50,682 INFO L226 Difference]: Without dead ends: 893 [2023-11-06 22:08:50,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:08:50,684 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 167 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:50,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 780 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2023-11-06 22:08:50,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 380. [2023-11-06 22:08:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 359 states have (on average 1.3593314763231197) internal successors, (488), 360 states have internal predecessors, (488), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-06 22:08:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 512 transitions. [2023-11-06 22:08:50,738 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 512 transitions. Word has length 92 [2023-11-06 22:08:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:50,738 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 512 transitions. [2023-11-06 22:08:50,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:08:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 512 transitions. [2023-11-06 22:08:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-06 22:08:50,740 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:50,740 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:50,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:50,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-06 22:08:50,948 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:50,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:50,948 INFO L85 PathProgramCache]: Analyzing trace with hash -512796489, now seen corresponding path program 1 times [2023-11-06 22:08:50,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:50,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892842921] [2023-11-06 22:08:50,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:50,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:51,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:08:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:51,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:51,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:51,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:08:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:51,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:51,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:51,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:08:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:51,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:08:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:51,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 22:08:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:51,505 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 22:08:51,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:51,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892842921] [2023-11-06 22:08:51,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892842921] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:08:51,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239852703] [2023-11-06 22:08:51,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:51,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:51,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:51,507 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:08:51,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:08:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:51,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:08:51,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 22:08:51,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:08:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 22:08:52,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239852703] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:08:52,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:08:52,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 5] total 16 [2023-11-06 22:08:52,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886830970] [2023-11-06 22:08:52,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:08:52,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 22:08:52,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:52,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:08:52,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:08:52,103 INFO L87 Difference]: Start difference. First operand 380 states and 512 transitions. Second operand has 16 states, 16 states have (on average 5.4375) internal successors, (87), 12 states have internal predecessors, (87), 2 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:08:52,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:52,748 INFO L93 Difference]: Finished difference Result 751 states and 1018 transitions. [2023-11-06 22:08:52,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:08:52,749 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 12 states have internal predecessors, (87), 2 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2023-11-06 22:08:52,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:52,752 INFO L225 Difference]: With dead ends: 751 [2023-11-06 22:08:52,752 INFO L226 Difference]: Without dead ends: 387 [2023-11-06 22:08:52,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2023-11-06 22:08:52,754 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 70 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:52,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 766 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:08:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2023-11-06 22:08:52,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2023-11-06 22:08:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 364 states have (on average 1.3543956043956045) internal successors, (493), 367 states have internal predecessors, (493), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2023-11-06 22:08:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 519 transitions. [2023-11-06 22:08:52,803 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 519 transitions. Word has length 99 [2023-11-06 22:08:52,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:52,804 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 519 transitions. [2023-11-06 22:08:52,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 12 states have internal predecessors, (87), 2 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:08:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 519 transitions. [2023-11-06 22:08:52,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-06 22:08:52,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:52,806 INFO L195 NwaCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:52,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:53,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:53,015 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:53,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:53,016 INFO L85 PathProgramCache]: Analyzing trace with hash 26616643, now seen corresponding path program 2 times [2023-11-06 22:08:53,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:53,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79392188] [2023-11-06 22:08:53,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:53,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:56,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:08:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:56,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:56,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:56,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:08:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:56,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:56,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:56,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:08:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:56,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:08:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:08:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 37 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 22:08:57,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:57,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79392188] [2023-11-06 22:08:57,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79392188] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:08:57,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463185411] [2023-11-06 22:08:57,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:08:57,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:57,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:57,699 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:08:57,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:08:58,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:08:58,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:08:58,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-06 22:08:58,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:58,698 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:58,699 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 72 [2023-11-06 22:08:58,718 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:08:58,719 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 51 [2023-11-06 22:08:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-06 22:08:58,882 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:08:58,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463185411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:58,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:08:58,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [20] total 25 [2023-11-06 22:08:58,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018790679] [2023-11-06 22:08:58,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:58,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:08:58,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:58,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:08:58,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:08:58,887 INFO L87 Difference]: Start difference. First operand 387 states and 519 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-06 22:08:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:59,159 INFO L93 Difference]: Finished difference Result 568 states and 749 transitions. [2023-11-06 22:08:59,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:08:59,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 105 [2023-11-06 22:08:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:59,163 INFO L225 Difference]: With dead ends: 568 [2023-11-06 22:08:59,163 INFO L226 Difference]: Without dead ends: 304 [2023-11-06 22:08:59,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2023-11-06 22:08:59,165 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 18 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:59,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 580 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:59,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-11-06 22:08:59,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 280. [2023-11-06 22:08:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 261 states have (on average 1.318007662835249) internal successors, (344), 262 states have internal predecessors, (344), 12 states have call successors, (12), 9 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 22:08:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 366 transitions. [2023-11-06 22:08:59,214 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 366 transitions. Word has length 105 [2023-11-06 22:08:59,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:59,214 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 366 transitions. [2023-11-06 22:08:59,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-06 22:08:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 366 transitions. [2023-11-06 22:08:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 22:08:59,216 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:59,216 INFO L195 NwaCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:59,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:08:59,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:59,425 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:59,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:59,425 INFO L85 PathProgramCache]: Analyzing trace with hash -998288533, now seen corresponding path program 1 times [2023-11-06 22:08:59,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:59,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744766321] [2023-11-06 22:08:59,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:59,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:59,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:08:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:59,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:59,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:59,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:08:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:59,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:08:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:59,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:08:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:59,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:08:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:00,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:09:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:00,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:09:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-06 22:09:00,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:00,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744766321] [2023-11-06 22:09:00,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744766321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:00,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:00,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:09:00,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415489364] [2023-11-06 22:09:00,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:00,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:09:00,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:00,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:09:00,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:09:00,110 INFO L87 Difference]: Start difference. First operand 280 states and 366 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 22:09:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:00,450 INFO L93 Difference]: Finished difference Result 282 states and 367 transitions. [2023-11-06 22:09:00,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:09:00,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 107 [2023-11-06 22:09:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:00,453 INFO L225 Difference]: With dead ends: 282 [2023-11-06 22:09:00,454 INFO L226 Difference]: Without dead ends: 275 [2023-11-06 22:09:00,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:09:00,455 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 92 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:00,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 392 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:09:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-11-06 22:09:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2023-11-06 22:09:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 257 states have (on average 1.3073929961089494) internal successors, (336), 257 states have internal predecessors, (336), 11 states have call successors, (11), 9 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 22:09:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 357 transitions. [2023-11-06 22:09:00,503 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 357 transitions. Word has length 107 [2023-11-06 22:09:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:00,503 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 357 transitions. [2023-11-06 22:09:00,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 22:09:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 357 transitions. [2023-11-06 22:09:00,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-06 22:09:00,507 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:00,507 INFO L195 NwaCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:00,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:09:00,507 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:09:00,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:00,508 INFO L85 PathProgramCache]: Analyzing trace with hash 550044308, now seen corresponding path program 1 times [2023-11-06 22:09:00,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:00,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403162942] [2023-11-06 22:09:00,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:00,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:00,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:09:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:00,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:09:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:00,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:09:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:00,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:09:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:00,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:09:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:00,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:09:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:00,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:09:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:00,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:09:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:00,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:09:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-06 22:09:01,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:01,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403162942] [2023-11-06 22:09:01,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403162942] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:01,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813040801] [2023-11-06 22:09:01,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:01,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:01,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:01,003 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:01,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:09:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:01,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:09:01,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-06 22:09:01,520 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:09:01,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813040801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:01,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:09:01,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2023-11-06 22:09:01,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609816902] [2023-11-06 22:09:01,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:01,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:09:01,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:01,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:09:01,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:09:01,523 INFO L87 Difference]: Start difference. First operand 275 states and 357 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:09:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:01,599 INFO L93 Difference]: Finished difference Result 275 states and 357 transitions. [2023-11-06 22:09:01,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:09:01,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 118 [2023-11-06 22:09:01,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:01,601 INFO L225 Difference]: With dead ends: 275 [2023-11-06 22:09:01,601 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:09:01,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:09:01,604 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:01,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 164 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:09:01,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:09:01,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:09:01,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:09:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:09:01,606 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2023-11-06 22:09:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:01,606 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:09:01,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:09:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:09:01,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:09:01,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:09:01,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:01,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 22:09:01,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:09:03,757 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocFINAL(lines 5894 5904) no Hoare annotation was computed. [2023-11-06 22:09:03,758 INFO L895 garLoopResultBuilder]: At program point L5899(line 5899) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (= |#memory_int| |old(#memory_int)|) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0))) [2023-11-06 22:09:03,758 INFO L899 garLoopResultBuilder]: For program point L5899-1(line 5899) no Hoare annotation was computed. [2023-11-06 22:09:03,758 INFO L902 garLoopResultBuilder]: At program point L5901(line 5901) the Hoare annotation is: true [2023-11-06 22:09:03,758 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocEXIT(lines 5894 5904) no Hoare annotation was computed. [2023-11-06 22:09:03,758 INFO L899 garLoopResultBuilder]: For program point L5901-1(line 5901) no Hoare annotation was computed. [2023-11-06 22:09:03,758 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 5894 5904) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))) [2023-11-06 22:09:03,758 INFO L899 garLoopResultBuilder]: For program point L5858-2(lines 5857 5859) no Hoare annotation was computed. [2023-11-06 22:09:03,759 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5857 5859) the Hoare annotation is: true [2023-11-06 22:09:03,759 INFO L899 garLoopResultBuilder]: For program point L5858(line 5858) no Hoare annotation was computed. [2023-11-06 22:09:03,759 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5857 5859) no Hoare annotation was computed. [2023-11-06 22:09:03,759 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 6260 6266) no Hoare annotation was computed. [2023-11-06 22:09:03,759 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 6260 6266) the Hoare annotation is: true [2023-11-06 22:09:03,759 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6264) no Hoare annotation was computed. [2023-11-06 22:09:03,759 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 6260 6266) no Hoare annotation was computed. [2023-11-06 22:09:03,759 INFO L902 garLoopResultBuilder]: At program point LDV_STOP(lines 5929 5935) the Hoare annotation is: true [2023-11-06 22:09:03,759 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5929 5935) no Hoare annotation was computed. [2023-11-06 22:09:03,760 INFO L899 garLoopResultBuilder]: For program point L6113-2(lines 6113 6116) no Hoare annotation was computed. [2023-11-06 22:09:03,760 INFO L895 garLoopResultBuilder]: At program point ldv_try_module_get_5_returnLabel#1(lines 6244 6251) the Hoare annotation is: (let ((.cse3 (= ~ldv_retval_0~0 0))) (or (and (= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 1) (not (= (mod (let ((.cse2 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2)))) (+ (select (select |#memory_$Pointer$.base| .cse0) .cse1) (select (select |#memory_$Pointer$.offset| .cse0) .cse1)))) 18446744073709551616) 0)) (= 2 ~ldv_module_refcounter~0) .cse3 (= |ULTIMATE.start_ldv_try_module_get_#res#1| 1)) (and (= ~ldv_module_refcounter~0 1) (= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 0) (= |ULTIMATE.start_ldv_try_module_get_#res#1| 0) .cse3))) [2023-11-06 22:09:03,760 INFO L899 garLoopResultBuilder]: For program point L6113(lines 6113 6116) no Hoare annotation was computed. [2023-11-06 22:09:03,760 INFO L895 garLoopResultBuilder]: At program point __request_module_returnLabel#1(lines 6373 6375) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2023-11-06 22:09:03,760 INFO L899 garLoopResultBuilder]: For program point L6204(lines 6204 6209) no Hoare annotation was computed. [2023-11-06 22:09:03,760 INFO L895 garLoopResultBuilder]: At program point ldv_initialize_returnLabel#1(lines 6376 6378) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2023-11-06 22:09:03,761 INFO L899 garLoopResultBuilder]: For program point L6320(lines 6320 6325) no Hoare annotation was computed. [2023-11-06 22:09:03,761 INFO L895 garLoopResultBuilder]: At program point pppox_init_returnLabel#1(lines 6138 6145) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_0~0 1) (= ~ldv_retval_0~0 0)) [2023-11-06 22:09:03,761 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 6156 6243) the Hoare annotation is: true [2023-11-06 22:09:03,761 INFO L899 garLoopResultBuilder]: For program point L6180(lines 6180 6236) no Hoare annotation was computed. [2023-11-06 22:09:03,761 INFO L899 garLoopResultBuilder]: For program point L6362(lines 6362 6365) no Hoare annotation was computed. [2023-11-06 22:09:03,761 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:09:03,761 INFO L902 garLoopResultBuilder]: At program point L6362-1(lines 6359 6368) the Hoare annotation is: true [2023-11-06 22:09:03,761 INFO L895 garLoopResultBuilder]: At program point pppox_exit_returnLabel#1(lines 6146 6152) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2023-11-06 22:09:03,762 INFO L895 garLoopResultBuilder]: At program point L6255(line 6255) the Hoare annotation is: (and (not (= (mod (+ |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.offset| |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.base|) 18446744073709551616) 0)) (= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 1) (not (= (mod (let ((.cse2 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2)))) (+ (select (select |#memory_$Pointer$.base| .cse0) .cse1) (select (select |#memory_$Pointer$.offset| .cse0) .cse1)))) 18446744073709551616) 0)) (= 2 ~ldv_module_refcounter~0) (= |ULTIMATE.start_pppox_create_~tmp~8#1| 1) (= |ULTIMATE.start_pppox_create_~tmp___0~3#1| 0) (= ~ldv_retval_0~0 0) (= |ULTIMATE.start_ldv_try_module_get_#res#1| 1)) [2023-11-06 22:09:03,762 INFO L895 garLoopResultBuilder]: At program point L6255-1(lines 6252 6258) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (not (= (mod (+ |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.offset| |ULTIMATE.start_ldv_module_put_6_~ldv_func_arg1#1.base|) 18446744073709551616) 0)) (= |ULTIMATE.start_ldv_try_module_get_5_#res#1| 1) (not (= (mod (let ((.cse2 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2)))) (+ (select (select |#memory_$Pointer$.base| .cse0) .cse1) (select (select |#memory_$Pointer$.offset| .cse0) .cse1)))) 18446744073709551616) 0)) (= |ULTIMATE.start_pppox_create_~tmp~8#1| 1) (= |ULTIMATE.start_pppox_create_~tmp___0~3#1| 0) (= ~ldv_retval_0~0 0) (= |ULTIMATE.start_ldv_try_module_get_#res#1| 1)) [2023-11-06 22:09:03,762 INFO L899 garLoopResultBuilder]: For program point L6214(lines 6214 6218) no Hoare annotation was computed. [2023-11-06 22:09:03,762 INFO L899 garLoopResultBuilder]: For program point L6181(line 6181) no Hoare annotation was computed. [2023-11-06 22:09:03,762 INFO L899 garLoopResultBuilder]: For program point L6214-2(lines 6212 6224) no Hoare annotation was computed. [2023-11-06 22:09:03,762 INFO L895 garLoopResultBuilder]: At program point L6363(line 6363) the Hoare annotation is: false [2023-11-06 22:09:03,762 INFO L895 garLoopResultBuilder]: At program point L6173(line 6173) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2023-11-06 22:09:03,763 INFO L895 garLoopResultBuilder]: At program point ldv_try_module_get_returnLabel#1(lines 6314 6330) the Hoare annotation is: (let ((.cse7 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse5 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse7)) (.cse6 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse7)))) (let ((.cse3 (select (select |#memory_$Pointer$.base| .cse5) .cse6)) (.cse4 (select (select |#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse0 (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse4)) (.cse1 (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse3)) (.cse2 (= ~ldv_retval_0~0 0))) (or (and (= ~ldv_module_refcounter~0 1) .cse0 .cse1 (= |ULTIMATE.start_ldv_try_module_get_#res#1| 0) .cse2) (and (not (= (mod (+ .cse3 .cse4) 18446744073709551616) 0)) (= 2 ~ldv_module_refcounter~0) .cse0 .cse1 .cse2 (= |ULTIMATE.start_ldv_try_module_get_#res#1| 1))))))) [2023-11-06 22:09:03,763 INFO L899 garLoopResultBuilder]: For program point L6173-1(line 6173) no Hoare annotation was computed. [2023-11-06 22:09:03,763 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:09:03,763 INFO L899 garLoopResultBuilder]: For program point L6182(lines 6182 6197) no Hoare annotation was computed. [2023-11-06 22:09:03,763 INFO L895 garLoopResultBuilder]: At program point L6174(line 6174) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2023-11-06 22:09:03,763 INFO L895 garLoopResultBuilder]: At program point sock_unregister_returnLabel#1(lines 6396 6398) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2023-11-06 22:09:03,763 INFO L899 garLoopResultBuilder]: For program point L6174-1(line 6174) no Hoare annotation was computed. [2023-11-06 22:09:03,764 INFO L895 garLoopResultBuilder]: At program point main_ldv_final#1(lines 6167 6242) the Hoare annotation is: (= ~ldv_module_refcounter~0 1) [2023-11-06 22:09:03,764 INFO L899 garLoopResultBuilder]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2023-11-06 22:09:03,764 INFO L899 garLoopResultBuilder]: For program point L6199(line 6199) no Hoare annotation was computed. [2023-11-06 22:09:03,764 INFO L895 garLoopResultBuilder]: At program point L6133(lines 6106 6135) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2023-11-06 22:09:03,764 INFO L899 garLoopResultBuilder]: For program point L6117(lines 6117 6130) no Hoare annotation was computed. [2023-11-06 22:09:03,767 INFO L899 garLoopResultBuilder]: For program point L6200(lines 6200 6232) no Hoare annotation was computed. [2023-11-06 22:09:03,767 INFO L899 garLoopResultBuilder]: For program point L6192(line 6192) no Hoare annotation was computed. [2023-11-06 22:09:03,767 INFO L899 garLoopResultBuilder]: For program point L6184(lines 6184 6194) no Hoare annotation was computed. [2023-11-06 22:09:03,768 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:09:03,768 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2023-11-06 22:09:03,768 INFO L899 garLoopResultBuilder]: For program point L6234(line 6234) no Hoare annotation was computed. [2023-11-06 22:09:03,768 INFO L899 garLoopResultBuilder]: For program point L6168-1(line 6168) no Hoare annotation was computed. [2023-11-06 22:09:03,768 INFO L895 garLoopResultBuilder]: At program point L6168(line 6168) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2023-11-06 22:09:03,769 INFO L902 garLoopResultBuilder]: At program point L6193(line 6193) the Hoare annotation is: true [2023-11-06 22:09:03,769 INFO L899 garLoopResultBuilder]: For program point L6185(line 6185) no Hoare annotation was computed. [2023-11-06 22:09:03,771 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:09:03,771 INFO L902 garLoopResultBuilder]: At program point L6235(line 6235) the Hoare annotation is: true [2023-11-06 22:09:03,772 INFO L899 garLoopResultBuilder]: For program point L6202(lines 6202 6229) no Hoare annotation was computed. [2023-11-06 22:09:03,772 INFO L899 garLoopResultBuilder]: For program point L6227(line 6227) no Hoare annotation was computed. [2023-11-06 22:09:03,772 INFO L899 garLoopResultBuilder]: For program point L6318(lines 6318 6327) no Hoare annotation was computed. [2023-11-06 22:09:03,772 INFO L895 garLoopResultBuilder]: At program point pppox_create_returnLabel#1(lines 6101 6136) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2023-11-06 22:09:03,772 INFO L899 garLoopResultBuilder]: For program point L6186(lines 6186 6190) no Hoare annotation was computed. [2023-11-06 22:09:03,772 INFO L895 garLoopResultBuilder]: At program point sock_register_returnLabel#1(lines 6393 6395) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_0~0 1) (= ~ldv_retval_0~0 0)) [2023-11-06 22:09:03,773 INFO L899 garLoopResultBuilder]: For program point L6211(line 6211) no Hoare annotation was computed. [2023-11-06 22:09:03,773 INFO L895 garLoopResultBuilder]: At program point L6178(lines 6167 6242) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_retval_0~0 0)) [2023-11-06 22:09:03,773 INFO L899 garLoopResultBuilder]: For program point L6203(line 6203) no Hoare annotation was computed. [2023-11-06 22:09:03,773 INFO L895 garLoopResultBuilder]: At program point L6170(line 6170) the Hoare annotation is: (and (= ~ldv_module_refcounter~0 1) (= ~ldv_state_variable_1~0 0) (= ~ldv_retval_0~0 0)) [2023-11-06 22:09:03,773 INFO L899 garLoopResultBuilder]: For program point L6170-1(line 6170) no Hoare annotation was computed. [2023-11-06 22:09:03,773 INFO L902 garLoopResultBuilder]: At program point L6228(line 6228) the Hoare annotation is: true [2023-11-06 22:09:03,774 INFO L899 garLoopResultBuilder]: For program point L6121-2(lines 6119 6130) no Hoare annotation was computed. [2023-11-06 22:09:03,774 INFO L899 garLoopResultBuilder]: For program point L6121(lines 6121 6125) no Hoare annotation was computed. [2023-11-06 22:09:03,774 INFO L895 garLoopResultBuilder]: At program point ldv_undef_int_returnLabel#1(lines 5913 5920) the Hoare annotation is: (let ((.cse4 (+ (* 8 |ULTIMATE.start_pppox_create_~protocol#1|) |~#pppox_protos~0.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse4)) (.cse3 (+ 16 (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse4)))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (.cse0 (select (select |#memory_$Pointer$.base| .cse2) .cse3))) (and (= ~ldv_module_refcounter~0 1) (not (= (mod (+ .cse0 .cse1) 18446744073709551616) 0)) (= |ULTIMATE.start_ldv_try_module_get_~module#1.offset| .cse1) (= |ULTIMATE.start_ldv_try_module_get_~module#1.base| .cse0) (= ~ldv_retval_0~0 0))))) [2023-11-06 22:09:03,775 INFO L899 garLoopResultBuilder]: For program point L6212(lines 6212 6225) no Hoare annotation was computed. [2023-11-06 22:09:03,776 INFO L899 garLoopResultBuilder]: For program point L6334(lines 6334 6341) no Hoare annotation was computed. [2023-11-06 22:09:03,776 INFO L899 garLoopResultBuilder]: For program point L6335-1(lines 6335 6338) no Hoare annotation was computed. [2023-11-06 22:09:03,776 INFO L899 garLoopResultBuilder]: For program point L6335(lines 6335 6338) no Hoare annotation was computed. [2023-11-06 22:09:03,776 INFO L895 garLoopResultBuilder]: At program point L6336(line 6336) the Hoare annotation is: (or (< |old(~ldv_module_refcounter~0)| 2) (not (= ~ldv_retval_0~0 0)) (< 2 |old(~ldv_module_refcounter~0)|)) [2023-11-06 22:09:03,777 INFO L899 garLoopResultBuilder]: For program point L6334-2(lines 6331 6344) no Hoare annotation was computed. [2023-11-06 22:09:03,777 INFO L899 garLoopResultBuilder]: For program point ldv_module_putEXIT(lines 6331 6344) no Hoare annotation was computed. [2023-11-06 22:09:03,777 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6331 6344) the Hoare annotation is: (or (< |old(~ldv_module_refcounter~0)| 2) (= 2 ~ldv_module_refcounter~0) (not (= ~ldv_retval_0~0 0)) (< 2 |old(~ldv_module_refcounter~0)|)) [2023-11-06 22:09:03,777 INFO L899 garLoopResultBuilder]: For program point ldv_memsetFINAL(lines 5905 5912) no Hoare annotation was computed. [2023-11-06 22:09:03,777 INFO L895 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0)) (< (mod |ldv_memset_#in~n#1| 18446744073709551616) 1) (= |ldv_memset_#in~n#1| |ldv_memset_#Ultimate.C_memset_#amount#1|)) [2023-11-06 22:09:03,777 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2023-11-06 22:09:03,778 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 5905 5912) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0)) (< (mod |ldv_memset_#in~n#1| 18446744073709551616) 1)) [2023-11-06 22:09:03,778 INFO L899 garLoopResultBuilder]: For program point ldv_memsetEXIT(lines 5905 5912) no Hoare annotation was computed. [2023-11-06 22:09:03,778 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:09:03,778 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (= |#memory_int| |old(#memory_int)|) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0))) [2023-11-06 22:09:03,778 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:09:03,781 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:03,783 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:09:03,797 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~ldv_func_arg1!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:09:03,798 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,798 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,798 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,800 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,802 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~ldv_func_arg1!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:09:03,803 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,803 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,803 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,803 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,807 ERROR L462 ceAbstractionStarter]: Failed to backtranslate (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~ldv_module_refcounter~0 1)) (not (= ~ldv_retval_0~0 0)) (< (mod |ldv_memset_#in~n#1| 18446744073709551616) 1) (= |ldv_memset_#in~n#1| |ldv_memset_#Ultimate.C_memset_#amount#1|)) [2023-11-06 22:09:03,812 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:09:03,813 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,813 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,813 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,814 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,814 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,820 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,820 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,820 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,821 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:09:03,821 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,821 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,821 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,821 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,827 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:09:03,827 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,827 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,833 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,834 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,834 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,834 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,835 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,835 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,835 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:09:03,835 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,836 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,836 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,836 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,837 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,838 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,838 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,838 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,839 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,839 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,840 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,840 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,844 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,844 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,845 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,845 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,845 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:09:03,845 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,846 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,846 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,846 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,851 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,852 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,852 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,852 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,853 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:09:03,853 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,853 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,853 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,853 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:03,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:09:03 BoogieIcfgContainer [2023-11-06 22:09:03,855 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:09:03,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:09:03,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:09:03,857 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:09:03,857 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:08:41" (3/4) ... [2023-11-06 22:09:03,859 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:09:03,863 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2023-11-06 22:09:03,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2023-11-06 22:09:03,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2023-11-06 22:09:03,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2023-11-06 22:09:03,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:09:03,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2023-11-06 22:09:03,865 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2023-11-06 22:09:03,883 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2023-11-06 22:09:03,884 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-11-06 22:09:03,885 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-06 22:09:03,886 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-06 22:09:03,934 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_module_refcounter == 1) && (\result == 1)) && (tmp == 1)) && (tmp___0 == 0)) && (ldv_retval_0 == 0)) && (\result == 1)) [2023-11-06 22:09:03,934 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_module_refcounter == 1) && (\result == 0)) && (ldv_retval_0 == 0)) || (((2 == ldv_module_refcounter) && (ldv_retval_0 == 0)) && (\result == 1))) [2023-11-06 22:09:03,935 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 1) && (2 == ldv_module_refcounter)) && (ldv_retval_0 == 0)) && (\result == 1)) || ((((ldv_module_refcounter == 1) && (\result == 0)) && (\result == 0)) && (ldv_retval_0 == 0))) [2023-11-06 22:09:04,012 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_module_refcounter == 1) && (\result == 1)) && (tmp == 1)) && (tmp___0 == 0)) && (ldv_retval_0 == 0)) && (\result == 1)) [2023-11-06 22:09:04,013 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_module_refcounter == 1) && (\result == 0)) && (ldv_retval_0 == 0)) || (((2 == ldv_module_refcounter) && (ldv_retval_0 == 0)) && (\result == 1))) [2023-11-06 22:09:04,015 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 1) && (2 == ldv_module_refcounter)) && (ldv_retval_0 == 0)) && (\result == 1)) || ((((ldv_module_refcounter == 1) && (\result == 0)) && (\result == 0)) && (ldv_retval_0 == 0))) [2023-11-06 22:09:04,049 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:09:04,050 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:09:04,050 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:09:04,050 INFO L158 Benchmark]: Toolchain (without parser) took 25649.79ms. Allocated memory was 218.1MB in the beginning and 478.2MB in the end (delta: 260.0MB). Free memory was 162.6MB in the beginning and 227.0MB in the end (delta: -64.4MB). Peak memory consumption was 196.6MB. Max. memory is 16.1GB. [2023-11-06 22:09:04,051 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 146.8MB. Free memory was 89.8MB in the beginning and 89.7MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:09:04,052 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1547.00ms. Allocated memory is still 218.1MB. Free memory was 162.6MB in the beginning and 137.9MB in the end (delta: 24.7MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2023-11-06 22:09:04,052 INFO L158 Benchmark]: Boogie Procedure Inliner took 127.11ms. Allocated memory is still 218.1MB. Free memory was 137.1MB in the beginning and 134.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:09:04,053 INFO L158 Benchmark]: Boogie Preprocessor took 116.02ms. Allocated memory is still 218.1MB. Free memory was 134.1MB in the beginning and 130.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:09:04,053 INFO L158 Benchmark]: RCFGBuilder took 881.49ms. Allocated memory is still 218.1MB. Free memory was 130.0MB in the beginning and 98.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-11-06 22:09:04,054 INFO L158 Benchmark]: TraceAbstraction took 22777.12ms. Allocated memory was 218.1MB in the beginning and 478.2MB in the end (delta: 260.0MB). Free memory was 98.1MB in the beginning and 237.5MB in the end (delta: -139.4MB). Peak memory consumption was 223.4MB. Max. memory is 16.1GB. [2023-11-06 22:09:04,055 INFO L158 Benchmark]: Witness Printer took 193.61ms. Allocated memory is still 478.2MB. Free memory was 237.5MB in the beginning and 227.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:09:04,060 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.67ms. Allocated memory is still 146.8MB. Free memory was 89.8MB in the beginning and 89.7MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1547.00ms. Allocated memory is still 218.1MB. Free memory was 162.6MB in the beginning and 137.9MB in the end (delta: 24.7MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 127.11ms. Allocated memory is still 218.1MB. Free memory was 137.1MB in the beginning and 134.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.02ms. Allocated memory is still 218.1MB. Free memory was 134.1MB in the beginning and 130.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 881.49ms. Allocated memory is still 218.1MB. Free memory was 130.0MB in the beginning and 98.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 22777.12ms. Allocated memory was 218.1MB in the beginning and 478.2MB in the end (delta: 260.0MB). Free memory was 98.1MB in the beginning and 237.5MB in the end (delta: -139.4MB). Peak memory consumption was 223.4MB. Max. memory is 16.1GB. * Witness Printer took 193.61ms. Allocated memory is still 478.2MB. Free memory was 237.5MB in the beginning and 227.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 6057]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6057] - GenericResultAtLocation [Line: 6060]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6060] - GenericResultAtLocation [Line: 6063]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6063] - GenericResultAtLocation [Line: 6066]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6066] - GenericResultAtLocation [Line: 6069]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [6069] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~ldv_func_arg1!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~ldv_func_arg1!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6264]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.6s, OverallIterations: 15, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1255 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1243 mSDsluCounter, 5681 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4103 mSDsCounter, 231 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1099 IncrementalHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 231 mSolverCounterUnsat, 1578 mSDtfsCounter, 1099 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1141 GetRequests, 981 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=387occurred in iteration=12, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 786 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 162 PreInvPairs, 238 NumberOfFragments, 773 HoareAnnotationTreeSize, 162 FomulaSimplifications, 11229 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 36 FomulaSimplificationsInter, 5347 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 1926 NumberOfCodeBlocks, 1926 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2002 ConstructedInterpolants, 0 QuantifiedInterpolants, 5010 SizeOfPredicates, 48 NumberOfNonLiveVariables, 6017 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 23 InterpolantComputations, 14 PerfectInterpolantSequences, 787/857 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5929]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6252]: Loop Invariant [2023-11-06 22:09:04,088 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~ldv_func_arg1!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:09:04,096 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,096 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,096 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,096 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,097 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~ldv_func_arg1!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:09:04,097 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,098 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,098 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,098 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated Derived loop invariant: ((((((ldv_module_refcounter == 1) && (\result == 1)) && (tmp == 1)) && (tmp___0 == 0)) && (ldv_retval_0 == 0)) && (\result == 1)) - InvariantResult [Line: 6396]: Loop Invariant Derived loop invariant: ((ldv_module_refcounter == 1) && (ldv_retval_0 == 0)) - InvariantResult [Line: 6146]: Loop Invariant Derived loop invariant: ((ldv_module_refcounter == 1) && (ldv_retval_0 == 0)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 6101]: Loop Invariant Derived loop invariant: ((ldv_module_refcounter == 1) && (ldv_retval_0 == 0)) - InvariantResult [Line: 6314]: Loop Invariant [2023-11-06 22:09:04,100 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:09:04,101 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,101 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,101 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,101 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,101 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,102 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,102 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,102 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,102 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:09:04,105 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,105 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,106 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,106 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,107 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:09:04,108 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,108 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,108 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,108 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,108 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,109 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,109 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,109 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,109 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:09:04,109 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,110 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,111 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,111 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated Derived loop invariant: ((((ldv_module_refcounter == 1) && (\result == 0)) && (ldv_retval_0 == 0)) || (((2 == ldv_module_refcounter) && (ldv_retval_0 == 0)) && (\result == 1))) - InvariantResult [Line: 6244]: Loop Invariant [2023-11-06 22:09:04,112 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,117 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,117 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,117 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,118 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,118 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,119 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,119 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated Derived loop invariant: (((((\result == 1) && (2 == ldv_module_refcounter)) && (ldv_retval_0 == 0)) && (\result == 1)) || ((((ldv_module_refcounter == 1) && (\result == 0)) && (\result == 0)) && (ldv_retval_0 == 0))) - InvariantResult [Line: 6138]: Loop Invariant Derived loop invariant: (((ldv_module_refcounter == 1) && (ldv_state_variable_0 == 1)) && (ldv_retval_0 == 0)) - InvariantResult [Line: 6167]: Loop Invariant Derived loop invariant: (ldv_module_refcounter == 1) - InvariantResult [Line: 6156]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6359]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5913]: Loop Invariant [2023-11-06 22:09:04,122 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,129 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,129 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,129 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,129 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:09:04,130 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,130 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,130 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,130 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,131 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,131 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,131 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,132 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,132 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~module!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:09:04,132 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,132 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,132 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated [2023-11-06 22:09:04,133 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#memory_$Pointer$.base[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]][16 + #memory_$Pointer$.offset[~#pppox_protos~0!base][8 * ~protocol + ~#pppox_protos~0!offset]] could not be translated Derived loop invariant: ((ldv_module_refcounter == 1) && (ldv_retval_0 == 0)) - InvariantResult [Line: 6393]: Loop Invariant Derived loop invariant: (((ldv_module_refcounter == 1) && (ldv_state_variable_0 == 1)) && (ldv_retval_0 == 0)) - InvariantResult [Line: 6373]: Loop Invariant Derived loop invariant: ((ldv_module_refcounter == 1) && (ldv_retval_0 == 0)) - InvariantResult [Line: 6167]: Loop Invariant Derived loop invariant: ((ldv_module_refcounter == 1) && (ldv_retval_0 == 0)) - InvariantResult [Line: 6376]: Loop Invariant Derived loop invariant: (((ldv_module_refcounter == 1) && (ldv_state_variable_1 == 0)) && (ldv_retval_0 == 0)) - InvariantResult [Line: 6106]: Loop Invariant Derived loop invariant: ((ldv_module_refcounter == 1) && (ldv_retval_0 == 0)) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:09:04,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d07650b2-9acf-4a82-952c-5b1aaae80820/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE