./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-pthread/cs_lazy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc 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_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-pthread/cs_lazy.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:58:38,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:58:38,875 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-29 00:58:38,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:58:38,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:58:38,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:58:38,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:58:38,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:58:38,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:58:38,903 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:58:38,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:58:38,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:58:38,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:58:38,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:58:38,906 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:58:38,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:58:38,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:58:38,907 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:58:38,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:58:38,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:58:38,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:58:38,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:58:38,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:58:38,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:58:38,910 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-29 00:58:38,911 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:58:38,911 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:58:38,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:58:38,912 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:58:38,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:58:38,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:58:38,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:58:38,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:58:38,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:58:38,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:58:38,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:58:38,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:58:38,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:58:38,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:58:38,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:58:38,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:58:38,915 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:58:38,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:58:38,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:58:38,916 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_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/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_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f [2023-11-29 00:58:39,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:58:39,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:58:39,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:58:39,163 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:58:39,163 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:58:39,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/seq-pthread/cs_lazy.i [2023-11-29 00:58:41,887 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:58:42,106 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:58:42,107 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/sv-benchmarks/c/seq-pthread/cs_lazy.i [2023-11-29 00:58:42,122 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/data/f90a5985a/989321998705437791e3982142179c24/FLAGfa7b39b72 [2023-11-29 00:58:42,135 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/data/f90a5985a/989321998705437791e3982142179c24 [2023-11-29 00:58:42,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:58:42,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:58:42,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:58:42,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:58:42,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:58:42,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:58:42" (1/1) ... [2023-11-29 00:58:42,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f698bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:42, skipping insertion in model container [2023-11-29 00:58:42,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:58:42" (1/1) ... [2023-11-29 00:58:42,202 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:58:42,559 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:58:42,573 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:58:42,635 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:58:42,666 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:58:42,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:42 WrapperNode [2023-11-29 00:58:42,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:58:42,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:58:42,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:58:42,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:58:42,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:42" (1/1) ... [2023-11-29 00:58:42,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:42" (1/1) ... [2023-11-29 00:58:42,738 INFO L138 Inliner]: procedures = 145, calls = 213, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 530 [2023-11-29 00:58:42,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:58:42,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:58:42,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:58:42,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:58:42,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:42" (1/1) ... [2023-11-29 00:58:42,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:42" (1/1) ... [2023-11-29 00:58:42,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:42" (1/1) ... [2023-11-29 00:58:42,797 INFO L175 MemorySlicer]: Split 109 memory accesses to 13 slices as follows [2, 10, 10, 25, 16, 5, 9, 0, 3, 8, 9, 3, 9]. 23 percent of accesses are in the largest equivalence class. The 30 initializations are split as follows [2, 4, 4, 8, 8, 0, 2, 0, 0, 2, 0, 0, 0]. The 30 writes are split as follows [0, 2, 2, 10, 4, 2, 3, 0, 1, 3, 1, 1, 1]. [2023-11-29 00:58:42,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:42" (1/1) ... [2023-11-29 00:58:42,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:42" (1/1) ... [2023-11-29 00:58:42,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:42" (1/1) ... [2023-11-29 00:58:42,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:42" (1/1) ... [2023-11-29 00:58:42,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:42" (1/1) ... [2023-11-29 00:58:42,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:42" (1/1) ... [2023-11-29 00:58:42,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:58:42,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:58:42,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:58:42,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:58:42,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:42" (1/1) ... [2023-11-29 00:58:42,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:58:42,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:58:42,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:58:42,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:58:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 00:58:42,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 00:58:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 00:58:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 00:58:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 00:58:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 00:58:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-29 00:58:42,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-29 00:58:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-11-29 00:58:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-11-29 00:58:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-11-29 00:58:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-11-29 00:58:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-11-29 00:58:42,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:58:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:58:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:58:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:58:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 00:58:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 00:58:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-29 00:58:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-29 00:58:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-11-29 00:58:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-11-29 00:58:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-11-29 00:58:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-11-29 00:58:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-11-29 00:58:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:58:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:58:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 00:58:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 00:58:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 00:58:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 00:58:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 00:58:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-29 00:58:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-29 00:58:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-11-29 00:58:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-11-29 00:58:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-11-29 00:58:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-11-29 00:58:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-11-29 00:58:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-11-29 00:58:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2023-11-29 00:58:42,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2023-11-29 00:58:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2023-11-29 00:58:42,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2023-11-29 00:58:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 00:58:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 00:58:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 00:58:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 00:58:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 00:58:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-29 00:58:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-29 00:58:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-11-29 00:58:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-11-29 00:58:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-11-29 00:58:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-11-29 00:58:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-11-29 00:58:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-11-29 00:58:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2023-11-29 00:58:42,939 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2023-11-29 00:58:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-11-29 00:58:42,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-11-29 00:58:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:58:42,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 00:58:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 00:58:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 00:58:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 00:58:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-29 00:58:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-29 00:58:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-29 00:58:42,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-11-29 00:58:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-11-29 00:58:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-11-29 00:58:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-11-29 00:58:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-11-29 00:58:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-11-29 00:58:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2023-11-29 00:58:42,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2023-11-29 00:58:42,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:58:42,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:58:42,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:58:42,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:58:42,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 00:58:42,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 00:58:42,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-29 00:58:42,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-29 00:58:42,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-29 00:58:42,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-11-29 00:58:42,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-11-29 00:58:42,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-11-29 00:58:42,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-11-29 00:58:42,943 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2023-11-29 00:58:42,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2023-11-29 00:58:42,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:58:42,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:58:43,170 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:58:43,172 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:58:43,508 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2023-11-29 00:58:43,508 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-29 00:58:43,508 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2023-11-29 00:58:43,508 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-29 00:58:43,508 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: SUMMARY for call __CS_cs(); srcloc: null [2023-11-29 00:58:43,509 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2023-11-29 00:58:43,509 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-29 00:58:47,779 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:58:47,821 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:58:47,821 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 00:58:47,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:58:47 BoogieIcfgContainer [2023-11-29 00:58:47,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:58:47,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:58:47,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:58:47,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:58:47,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:58:42" (1/3) ... [2023-11-29 00:58:47,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284fdfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:58:47, skipping insertion in model container [2023-11-29 00:58:47,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:42" (2/3) ... [2023-11-29 00:58:47,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284fdfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:58:47, skipping insertion in model container [2023-11-29 00:58:47,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:58:47" (3/3) ... [2023-11-29 00:58:47,831 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2023-11-29 00:58:47,849 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:58:47,849 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-11-29 00:58:47,902 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:58:47,909 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f576f4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:58:47,909 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 00:58:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 123 states have (on average 1.6016260162601625) internal successors, (197), 139 states have internal predecessors, (197), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-11-29 00:58:47,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 00:58:47,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:47,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 00:58:47,922 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:58:47,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:47,927 INFO L85 PathProgramCache]: Analyzing trace with hash 17537217, now seen corresponding path program 1 times [2023-11-29 00:58:47,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:58:47,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292140636] [2023-11-29 00:58:47,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:47,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:58:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:48,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:58:48,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292140636] [2023-11-29 00:58:48,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292140636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:58:48,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:58:48,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:58:48,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321635606] [2023-11-29 00:58:48,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:58:48,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:58:48,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:58:48,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:58:48,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:58:48,270 INFO L87 Difference]: Start difference. First operand has 183 states, 123 states have (on average 1.6016260162601625) internal successors, (197), 139 states have internal predecessors, (197), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-29 00:58:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:48,392 INFO L93 Difference]: Finished difference Result 359 states and 575 transitions. [2023-11-29 00:58:48,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:58:48,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 00:58:48,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:48,405 INFO L225 Difference]: With dead ends: 359 [2023-11-29 00:58:48,405 INFO L226 Difference]: Without dead ends: 150 [2023-11-29 00:58:48,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:58:48,417 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 1 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:48,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 465 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:58:48,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-29 00:58:48,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2023-11-29 00:58:48,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 99 states have (on average 1.4848484848484849) internal successors, (147), 107 states have internal predecessors, (147), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 00:58:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 220 transitions. [2023-11-29 00:58:48,472 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 220 transitions. Word has length 4 [2023-11-29 00:58:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:48,472 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 220 transitions. [2023-11-29 00:58:48,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-29 00:58:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 220 transitions. [2023-11-29 00:58:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 00:58:48,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:48,474 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-11-29 00:58:48,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:58:48,474 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:58:48,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:48,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1534447953, now seen corresponding path program 1 times [2023-11-29 00:58:48,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:58:48,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098790925] [2023-11-29 00:58:48,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:48,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:58:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:48,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:58:48,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098790925] [2023-11-29 00:58:48,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098790925] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:58:48,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680287316] [2023-11-29 00:58:48,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:48,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:58:48,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:58:48,633 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:58:48,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:58:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:48,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:58:48,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:48,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:48,921 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:58:48,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680287316] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:58:48,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:58:48,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-11-29 00:58:48,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637896392] [2023-11-29 00:58:48,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:58:48,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:58:48,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:58:48,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:58:48,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:58:48,925 INFO L87 Difference]: Start difference. First operand 150 states and 220 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-29 00:58:49,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:49,009 INFO L93 Difference]: Finished difference Result 150 states and 220 transitions. [2023-11-29 00:58:49,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:58:49,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 00:58:49,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:49,012 INFO L225 Difference]: With dead ends: 150 [2023-11-29 00:58:49,012 INFO L226 Difference]: Without dead ends: 149 [2023-11-29 00:58:49,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:58:49,014 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 3 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:49,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 611 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:58:49,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-29 00:58:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2023-11-29 00:58:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 106 states have internal predecessors, (146), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 00:58:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 219 transitions. [2023-11-29 00:58:49,034 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 219 transitions. Word has length 7 [2023-11-29 00:58:49,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:49,035 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 219 transitions. [2023-11-29 00:58:49,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-29 00:58:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 219 transitions. [2023-11-29 00:58:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 00:58:49,036 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:49,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:58:49,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:58:49,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:58:49,242 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:58:49,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:49,243 INFO L85 PathProgramCache]: Analyzing trace with hash -323247683, now seen corresponding path program 1 times [2023-11-29 00:58:49,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:58:49,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945366552] [2023-11-29 00:58:49,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:49,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:58:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:49,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:58:49,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945366552] [2023-11-29 00:58:49,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945366552] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:58:49,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967609882] [2023-11-29 00:58:49,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:49,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:58:49,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:58:49,335 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:58:49,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:58:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:49,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:58:49,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:58:49,574 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:58:49,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967609882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:58:49,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:58:49,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2023-11-29 00:58:49,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456745080] [2023-11-29 00:58:49,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:58:49,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:58:49,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:58:49,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:58:49,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:58:49,577 INFO L87 Difference]: Start difference. First operand 149 states and 219 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-29 00:58:49,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:49,728 INFO L93 Difference]: Finished difference Result 149 states and 219 transitions. [2023-11-29 00:58:49,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:58:49,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 00:58:49,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:49,730 INFO L225 Difference]: With dead ends: 149 [2023-11-29 00:58:49,730 INFO L226 Difference]: Without dead ends: 148 [2023-11-29 00:58:49,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:58:49,732 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 4 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:49,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 399 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:58:49,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-29 00:58:49,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2023-11-29 00:58:49,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 105 states have internal predecessors, (145), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 00:58:49,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2023-11-29 00:58:49,749 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 8 [2023-11-29 00:58:49,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:49,749 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2023-11-29 00:58:49,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-29 00:58:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2023-11-29 00:58:49,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 00:58:49,750 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:49,750 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2023-11-29 00:58:49,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:58:49,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:58:49,955 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:58:49,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:49,955 INFO L85 PathProgramCache]: Analyzing trace with hash -323245954, now seen corresponding path program 1 times [2023-11-29 00:58:49,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:58:49,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684329088] [2023-11-29 00:58:49,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:49,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:58:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:58:50,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:58:50,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684329088] [2023-11-29 00:58:50,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684329088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:58:50,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:58:50,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:58:50,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989447888] [2023-11-29 00:58:50,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:58:50,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:58:50,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:58:50,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:58:50,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:58:50,022 INFO L87 Difference]: Start difference. First operand 148 states and 218 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-29 00:58:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:50,068 INFO L93 Difference]: Finished difference Result 148 states and 218 transitions. [2023-11-29 00:58:50,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:58:50,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 00:58:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:50,071 INFO L225 Difference]: With dead ends: 148 [2023-11-29 00:58:50,071 INFO L226 Difference]: Without dead ends: 147 [2023-11-29 00:58:50,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:58:50,072 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 407 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-29 00:58:50,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 407 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:58:50,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-29 00:58:50,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2023-11-29 00:58:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 102 states have internal predecessors, (142), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 00:58:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2023-11-29 00:58:50,087 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 8 [2023-11-29 00:58:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:50,087 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2023-11-29 00:58:50,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-29 00:58:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2023-11-29 00:58:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 00:58:50,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:50,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:58:50,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:58:50,089 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:58:50,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:50,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1430743239, now seen corresponding path program 1 times [2023-11-29 00:58:50,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:58:50,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494978825] [2023-11-29 00:58:50,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:50,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:58:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:50,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:58:50,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494978825] [2023-11-29 00:58:50,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494978825] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:58:50,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831988972] [2023-11-29 00:58:50,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:50,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:58:50,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:58:50,175 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:58:50,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:58:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:50,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:58:50,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:58:50,394 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:58:50,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831988972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:58:50,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:58:50,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2023-11-29 00:58:50,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113542594] [2023-11-29 00:58:50,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:58:50,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:58:50,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:58:50,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:58:50,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:58:50,396 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-29 00:58:51,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:51,029 INFO L93 Difference]: Finished difference Result 289 states and 429 transitions. [2023-11-29 00:58:51,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:58:51,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 00:58:51,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:51,032 INFO L225 Difference]: With dead ends: 289 [2023-11-29 00:58:51,032 INFO L226 Difference]: Without dead ends: 153 [2023-11-29 00:58:51,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:58:51,034 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:51,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 403 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 00:58:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-29 00:58:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2023-11-29 00:58:51,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 105 states have (on average 1.438095238095238) internal successors, (151), 110 states have internal predecessors, (151), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 00:58:51,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 224 transitions. [2023-11-29 00:58:51,048 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 224 transitions. Word has length 9 [2023-11-29 00:58:51,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:51,049 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 224 transitions. [2023-11-29 00:58:51,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-29 00:58:51,049 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 224 transitions. [2023-11-29 00:58:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 00:58:51,050 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:51,050 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2023-11-29 00:58:51,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 00:58:51,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:58:51,255 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:58:51,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:51,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1146862288, now seen corresponding path program 1 times [2023-11-29 00:58:51,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:58:51,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913648597] [2023-11-29 00:58:51,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:58:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:58:51,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:58:51,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913648597] [2023-11-29 00:58:51,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913648597] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:58:51,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020830511] [2023-11-29 00:58:51,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:51,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:58:51,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:58:51,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:58:51,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:58:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:51,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:58:51,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:51,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 00:58:51,622 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:58:51,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020830511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:58:51,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:58:51,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-11-29 00:58:51,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459764207] [2023-11-29 00:58:51,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:58:51,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:58:51,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:58:51,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:58:51,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:58:51,624 INFO L87 Difference]: Start difference. First operand 153 states and 224 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:58:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:52,073 INFO L93 Difference]: Finished difference Result 153 states and 224 transitions. [2023-11-29 00:58:52,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:58:52,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 00:58:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:52,075 INFO L225 Difference]: With dead ends: 153 [2023-11-29 00:58:52,075 INFO L226 Difference]: Without dead ends: 152 [2023-11-29 00:58:52,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:58:52,077 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:52,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 399 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:58:52,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-29 00:58:52,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 145. [2023-11-29 00:58:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 102 states have internal predecessors, (142), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 00:58:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2023-11-29 00:58:52,087 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 17 [2023-11-29 00:58:52,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:52,087 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2023-11-29 00:58:52,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:58:52,088 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2023-11-29 00:58:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-29 00:58:52,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:52,092 INFO L195 NwaCegarLoop]: trace histogram [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-29 00:58:52,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 00:58:52,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 00:58:52,295 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:58:52,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:52,295 INFO L85 PathProgramCache]: Analyzing trace with hash 2071616295, now seen corresponding path program 1 times [2023-11-29 00:58:52,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:58:52,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91718285] [2023-11-29 00:58:52,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:52,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:58:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:52,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 00:58:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:52,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:58:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:52,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:58:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 00:58:52,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:58:52,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91718285] [2023-11-29 00:58:52,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91718285] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:58:52,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33030427] [2023-11-29 00:58:52,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:52,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:58:52,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:58:52,496 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:58:52,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 00:58:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:52,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:58:52,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 00:58:52,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:58:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 00:58:52,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33030427] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:58:52,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:58:52,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2023-11-29 00:58:52,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429186197] [2023-11-29 00:58:52,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:58:52,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:58:52,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:58:52,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:58:52,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:58:52,900 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 00:58:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:54,069 INFO L93 Difference]: Finished difference Result 303 states and 452 transitions. [2023-11-29 00:58:54,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:58:54,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 48 [2023-11-29 00:58:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:54,072 INFO L225 Difference]: With dead ends: 303 [2023-11-29 00:58:54,072 INFO L226 Difference]: Without dead ends: 160 [2023-11-29 00:58:54,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:58:54,075 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 70 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:54,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 656 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 00:58:54,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-29 00:58:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2023-11-29 00:58:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 107 states have (on average 1.411214953271028) internal successors, (151), 111 states have internal predecessors, (151), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 00:58:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 224 transitions. [2023-11-29 00:58:54,089 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 224 transitions. Word has length 48 [2023-11-29 00:58:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:54,089 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 224 transitions. [2023-11-29 00:58:54,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 00:58:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2023-11-29 00:58:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 00:58:54,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:54,092 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-11-29 00:58:54,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 00:58:54,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-29 00:58:54,295 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:58:54,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:54,295 INFO L85 PathProgramCache]: Analyzing trace with hash 255495658, now seen corresponding path program 1 times [2023-11-29 00:58:54,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:58:54,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32644657] [2023-11-29 00:58:54,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:54,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:58:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:54,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 00:58:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:54,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 00:58:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:54,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 00:58:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-29 00:58:54,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:58:54,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32644657] [2023-11-29 00:58:54,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32644657] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:58:54,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618914897] [2023-11-29 00:58:54,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:54,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:58:54,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:58:54,510 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:58:54,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 00:58:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:54,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:58:54,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-29 00:58:54,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:58:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-29 00:58:54,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618914897] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:58:54,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:58:54,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 7 [2023-11-29 00:58:54,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215175623] [2023-11-29 00:58:54,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:58:54,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:58:54,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:58:54,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:58:54,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:58:54,950 INFO L87 Difference]: Start difference. First operand 154 states and 224 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 00:58:57,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:58:58,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:58,123 INFO L93 Difference]: Finished difference Result 312 states and 458 transitions. [2023-11-29 00:58:58,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:58:58,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2023-11-29 00:58:58,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:58,126 INFO L225 Difference]: With dead ends: 312 [2023-11-29 00:58:58,126 INFO L226 Difference]: Without dead ends: 177 [2023-11-29 00:58:58,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:58:58,128 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 73 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:58,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 480 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 00:58:58,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-29 00:58:58,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2023-11-29 00:58:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 128 states have internal predecessors, (169), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 00:58:58,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 242 transitions. [2023-11-29 00:58:58,142 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 242 transitions. Word has length 55 [2023-11-29 00:58:58,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:58,142 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 242 transitions. [2023-11-29 00:58:58,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 00:58:58,143 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 242 transitions. [2023-11-29 00:58:58,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 00:58:58,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:58,145 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2023-11-29 00:58:58,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 00:58:58,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-29 00:58:58,347 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:58:58,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:58,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1180339752, now seen corresponding path program 1 times [2023-11-29 00:58:58,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:58:58,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541538576] [2023-11-29 00:58:58,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:58,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:58:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:58,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 00:58:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:58,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 00:58:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:58,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 00:58:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-29 00:58:58,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:58:58,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541538576] [2023-11-29 00:58:58,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541538576] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:58:58,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:58:58,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:58:58,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374760816] [2023-11-29 00:58:58,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:58:58,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:58:58,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:58:58,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:58:58,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:58:58,947 INFO L87 Difference]: Start difference. First operand 171 states and 242 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:59:00,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:00,878 INFO L93 Difference]: Finished difference Result 465 states and 697 transitions. [2023-11-29 00:59:00,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:59:00,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 70 [2023-11-29 00:59:00,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:00,882 INFO L225 Difference]: With dead ends: 465 [2023-11-29 00:59:00,882 INFO L226 Difference]: Without dead ends: 338 [2023-11-29 00:59:00,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:59:00,884 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 330 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:00,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 756 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 00:59:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-11-29 00:59:00,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 320. [2023-11-29 00:59:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 224 states have (on average 1.4107142857142858) internal successors, (316), 228 states have internal predecessors, (316), 79 states have call successors, (79), 13 states have call predecessors, (79), 13 states have return successors, (82), 78 states have call predecessors, (82), 77 states have call successors, (82) [2023-11-29 00:59:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 477 transitions. [2023-11-29 00:59:00,914 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 477 transitions. Word has length 70 [2023-11-29 00:59:00,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:00,914 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 477 transitions. [2023-11-29 00:59:00,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:59:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 477 transitions. [2023-11-29 00:59:00,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 00:59:00,916 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:00,917 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2023-11-29 00:59:00,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:59:00,917 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:59:00,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:00,917 INFO L85 PathProgramCache]: Analyzing trace with hash 953916605, now seen corresponding path program 1 times [2023-11-29 00:59:00,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:59:00,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296650584] [2023-11-29 00:59:00,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:00,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:59:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:59:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:59:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 00:59:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-29 00:59:01,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:59:01,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296650584] [2023-11-29 00:59:01,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296650584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:59:01,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:59:01,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:59:01,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10165620] [2023-11-29 00:59:01,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:59:01,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:59:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:59:01,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:59:01,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:59:01,423 INFO L87 Difference]: Start difference. First operand 320 states and 477 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:59:05,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:59:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:06,551 INFO L93 Difference]: Finished difference Result 632 states and 961 transitions. [2023-11-29 00:59:06,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:59:06,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 68 [2023-11-29 00:59:06,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:06,555 INFO L225 Difference]: With dead ends: 632 [2023-11-29 00:59:06,555 INFO L226 Difference]: Without dead ends: 361 [2023-11-29 00:59:06,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:59:06,558 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 364 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 168 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:06,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 671 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2023-11-29 00:59:06,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-11-29 00:59:06,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 343. [2023-11-29 00:59:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 239 states have (on average 1.4142259414225942) internal successors, (338), 244 states have internal predecessors, (338), 85 states have call successors, (85), 14 states have call predecessors, (85), 15 states have return successors, (91), 84 states have call predecessors, (91), 83 states have call successors, (91) [2023-11-29 00:59:06,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 514 transitions. [2023-11-29 00:59:06,585 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 514 transitions. Word has length 68 [2023-11-29 00:59:06,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:06,586 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 514 transitions. [2023-11-29 00:59:06,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:59:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 514 transitions. [2023-11-29 00:59:06,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 00:59:06,588 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:06,588 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2023-11-29 00:59:06,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:59:06,588 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:59:06,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:06,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1892842551, now seen corresponding path program 1 times [2023-11-29 00:59:06,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:59:06,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847543527] [2023-11-29 00:59:06,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:06,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:59:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:06,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:59:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:06,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 00:59:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:06,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 00:59:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-29 00:59:06,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:59:06,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847543527] [2023-11-29 00:59:06,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847543527] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:59:06,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:59:06,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:59:06,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842662296] [2023-11-29 00:59:06,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:59:06,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:59:06,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:59:06,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:59:06,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:59:06,941 INFO L87 Difference]: Start difference. First operand 343 states and 514 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:59:09,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:59:13,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:59:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:14,396 INFO L93 Difference]: Finished difference Result 634 states and 960 transitions. [2023-11-29 00:59:14,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:59:14,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 68 [2023-11-29 00:59:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:14,400 INFO L225 Difference]: With dead ends: 634 [2023-11-29 00:59:14,401 INFO L226 Difference]: Without dead ends: 342 [2023-11-29 00:59:14,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:59:14,403 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 329 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 152 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:14,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 599 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 509 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2023-11-29 00:59:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-11-29 00:59:14,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 326. [2023-11-29 00:59:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 228 states have (on average 1.4035087719298245) internal successors, (320), 233 states have internal predecessors, (320), 79 states have call successors, (79), 14 states have call predecessors, (79), 15 states have return successors, (85), 78 states have call predecessors, (85), 77 states have call successors, (85) [2023-11-29 00:59:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 484 transitions. [2023-11-29 00:59:14,436 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 484 transitions. Word has length 68 [2023-11-29 00:59:14,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:14,437 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 484 transitions. [2023-11-29 00:59:14,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:59:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 484 transitions. [2023-11-29 00:59:14,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 00:59:14,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:14,439 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2023-11-29 00:59:14,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:59:14,439 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:59:14,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:14,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1666419404, now seen corresponding path program 1 times [2023-11-29 00:59:14,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:59:14,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021211653] [2023-11-29 00:59:14,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:14,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:59:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:14,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 00:59:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:14,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 00:59:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:14,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 00:59:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-29 00:59:14,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:59:14,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021211653] [2023-11-29 00:59:14,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021211653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:59:14,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:59:14,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:59:14,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020303027] [2023-11-29 00:59:14,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:59:14,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:59:14,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:59:14,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:59:14,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:59:14,878 INFO L87 Difference]: Start difference. First operand 326 states and 484 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:59:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:16,984 INFO L93 Difference]: Finished difference Result 589 states and 884 transitions. [2023-11-29 00:59:16,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:59:16,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 70 [2023-11-29 00:59:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:16,988 INFO L225 Difference]: With dead ends: 589 [2023-11-29 00:59:16,988 INFO L226 Difference]: Without dead ends: 318 [2023-11-29 00:59:16,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:59:16,991 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 299 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:16,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 748 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 00:59:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2023-11-29 00:59:17,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 302. [2023-11-29 00:59:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 212 states have (on average 1.3962264150943395) internal successors, (296), 217 states have internal predecessors, (296), 72 states have call successors, (72), 13 states have call predecessors, (72), 14 states have return successors, (78), 71 states have call predecessors, (78), 70 states have call successors, (78) [2023-11-29 00:59:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 446 transitions. [2023-11-29 00:59:17,013 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 446 transitions. Word has length 70 [2023-11-29 00:59:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:17,013 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 446 transitions. [2023-11-29 00:59:17,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:59:17,013 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 446 transitions. [2023-11-29 00:59:17,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 00:59:17,014 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:17,014 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2023-11-29 00:59:17,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:59:17,015 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:59:17,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:17,015 INFO L85 PathProgramCache]: Analyzing trace with hash 770126046, now seen corresponding path program 2 times [2023-11-29 00:59:17,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:59:17,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81171419] [2023-11-29 00:59:17,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:17,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:59:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:17,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 00:59:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:17,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 00:59:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:17,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 00:59:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-29 00:59:17,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:59:17,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81171419] [2023-11-29 00:59:17,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81171419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:59:17,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:59:17,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:59:17,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796481262] [2023-11-29 00:59:17,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:59:17,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:59:17,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:59:17,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:59:17,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:59:17,412 INFO L87 Difference]: Start difference. First operand 302 states and 446 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:59:21,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:59:26,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:59:26,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:26,647 INFO L93 Difference]: Finished difference Result 485 states and 717 transitions. [2023-11-29 00:59:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:59:26,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 74 [2023-11-29 00:59:26,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:26,650 INFO L225 Difference]: With dead ends: 485 [2023-11-29 00:59:26,651 INFO L226 Difference]: Without dead ends: 332 [2023-11-29 00:59:26,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:59:26,652 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 329 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 149 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:26,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 745 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 445 Invalid, 1 Unknown, 0 Unchecked, 9.1s Time] [2023-11-29 00:59:26,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-11-29 00:59:26,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 314. [2023-11-29 00:59:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 221 states have (on average 1.3846153846153846) internal successors, (306), 225 states have internal predecessors, (306), 75 states have call successors, (75), 14 states have call predecessors, (75), 14 states have return successors, (81), 74 states have call predecessors, (81), 73 states have call successors, (81) [2023-11-29 00:59:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 462 transitions. [2023-11-29 00:59:26,684 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 462 transitions. Word has length 74 [2023-11-29 00:59:26,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:26,684 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 462 transitions. [2023-11-29 00:59:26,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:59:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 462 transitions. [2023-11-29 00:59:26,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-29 00:59:26,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:26,686 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2023-11-29 00:59:26,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:59:26,687 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:59:26,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:26,687 INFO L85 PathProgramCache]: Analyzing trace with hash 357769779, now seen corresponding path program 2 times [2023-11-29 00:59:26,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:59:26,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601153866] [2023-11-29 00:59:26,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:26,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:59:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:26,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:59:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:27,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:59:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:27,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:59:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-29 00:59:27,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:59:27,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601153866] [2023-11-29 00:59:27,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601153866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:59:27,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:59:27,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:59:27,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769000082] [2023-11-29 00:59:27,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:59:27,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:59:27,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:59:27,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:59:27,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:59:27,023 INFO L87 Difference]: Start difference. First operand 314 states and 462 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:59:31,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:59:32,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:59:33,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:33,145 INFO L93 Difference]: Finished difference Result 536 states and 779 transitions. [2023-11-29 00:59:33,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:59:33,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 72 [2023-11-29 00:59:33,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:33,147 INFO L225 Difference]: With dead ends: 536 [2023-11-29 00:59:33,147 INFO L226 Difference]: Without dead ends: 299 [2023-11-29 00:59:33,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:59:33,149 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 259 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 119 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:33,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 757 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 443 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2023-11-29 00:59:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-29 00:59:33,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 283. [2023-11-29 00:59:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 203 states have (on average 1.3448275862068966) internal successors, (273), 207 states have internal predecessors, (273), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (66), 61 states have call predecessors, (66), 60 states have call successors, (66) [2023-11-29 00:59:33,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 401 transitions. [2023-11-29 00:59:33,177 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 401 transitions. Word has length 72 [2023-11-29 00:59:33,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:33,177 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 401 transitions. [2023-11-29 00:59:33,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:59:33,178 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 401 transitions. [2023-11-29 00:59:33,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-29 00:59:33,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:33,179 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2023-11-29 00:59:33,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:59:33,179 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:59:33,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:33,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1805977919, now seen corresponding path program 1 times [2023-11-29 00:59:33,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:59:33,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124865975] [2023-11-29 00:59:33,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:33,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:59:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:33,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:59:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:33,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:59:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:33,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:59:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-29 00:59:33,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:59:33,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124865975] [2023-11-29 00:59:33,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124865975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:59:33,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:59:33,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:59:33,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843430780] [2023-11-29 00:59:33,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:59:33,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:59:33,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:59:33,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:59:33,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:59:33,600 INFO L87 Difference]: Start difference. First operand 283 states and 401 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:59:35,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:59:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:36,945 INFO L93 Difference]: Finished difference Result 325 states and 450 transitions. [2023-11-29 00:59:36,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:59:36,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 72 [2023-11-29 00:59:36,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:36,948 INFO L225 Difference]: With dead ends: 325 [2023-11-29 00:59:36,948 INFO L226 Difference]: Without dead ends: 265 [2023-11-29 00:59:36,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:59:36,949 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 202 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:36,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 753 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-29 00:59:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-11-29 00:59:36,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 253. [2023-11-29 00:59:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 182 states have (on average 1.335164835164835) internal successors, (243), 186 states have internal predecessors, (243), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (59), 54 states have call predecessors, (59), 53 states have call successors, (59) [2023-11-29 00:59:36,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 357 transitions. [2023-11-29 00:59:36,975 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 357 transitions. Word has length 72 [2023-11-29 00:59:36,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:36,975 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 357 transitions. [2023-11-29 00:59:36,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:59:36,976 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 357 transitions. [2023-11-29 00:59:36,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 00:59:36,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:36,977 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2023-11-29 00:59:36,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:59:36,977 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:59:36,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:36,978 INFO L85 PathProgramCache]: Analyzing trace with hash -2076633110, now seen corresponding path program 1 times [2023-11-29 00:59:36,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:59:36,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130012716] [2023-11-29 00:59:36,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:36,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:59:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 00:59:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 00:59:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 00:59:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-29 00:59:37,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:59:37,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130012716] [2023-11-29 00:59:37,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130012716] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:59:37,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:59:37,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:59:37,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353730695] [2023-11-29 00:59:37,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:59:37,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:59:37,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:59:37,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:59:37,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:59:37,372 INFO L87 Difference]: Start difference. First operand 253 states and 357 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:59:42,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:59:42,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:42,957 INFO L93 Difference]: Finished difference Result 270 states and 379 transitions. [2023-11-29 00:59:42,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:59:42,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 74 [2023-11-29 00:59:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:42,959 INFO L225 Difference]: With dead ends: 270 [2023-11-29 00:59:42,959 INFO L226 Difference]: Without dead ends: 205 [2023-11-29 00:59:42,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:59:42,960 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 164 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 84 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:42,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 759 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 411 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2023-11-29 00:59:42,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-29 00:59:42,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 199. [2023-11-29 00:59:42,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 142 states have (on average 1.3169014084507042) internal successors, (187), 147 states have internal predecessors, (187), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (47), 42 states have call predecessors, (47), 43 states have call successors, (47) [2023-11-29 00:59:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 278 transitions. [2023-11-29 00:59:42,980 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 278 transitions. Word has length 74 [2023-11-29 00:59:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:42,980 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 278 transitions. [2023-11-29 00:59:42,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:59:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 278 transitions. [2023-11-29 00:59:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 00:59:42,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:42,982 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 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-29 00:59:42,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:59:42,983 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:59:42,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:42,983 INFO L85 PathProgramCache]: Analyzing trace with hash -657228600, now seen corresponding path program 1 times [2023-11-29 00:59:42,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:59:42,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003604887] [2023-11-29 00:59:42,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:42,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:59:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:44,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:59:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:44,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:59:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:44,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:59:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:44,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:59:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:44,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:59:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:44,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 00:59:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:44,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 00:59:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:44,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 00:59:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2023-11-29 00:59:44,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:59:44,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003604887] [2023-11-29 00:59:44,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003604887] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:59:44,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088937627] [2023-11-29 00:59:44,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:44,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:59:44,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:59:44,467 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:59:44,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 00:59:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:45,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 00:59:45,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:59:45,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 00:59:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-11-29 00:59:45,466 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:59:45,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088937627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:59:45,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:59:45,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2023-11-29 00:59:45,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594068957] [2023-11-29 00:59:45,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:59:45,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:59:45,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:59:45,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:59:45,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2023-11-29 00:59:45,469 INFO L87 Difference]: Start difference. First operand 199 states and 278 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-29 00:59:47,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:59:49,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:59:52,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:59:53,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:53,612 INFO L93 Difference]: Finished difference Result 392 states and 578 transitions. [2023-11-29 00:59:53,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:59:53,613 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 113 [2023-11-29 00:59:53,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:53,615 INFO L225 Difference]: With dead ends: 392 [2023-11-29 00:59:53,615 INFO L226 Difference]: Without dead ends: 239 [2023-11-29 00:59:53,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2023-11-29 00:59:53,617 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 423 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:53,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 663 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2023-11-29 00:59:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-11-29 00:59:53,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 215. [2023-11-29 00:59:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 151 states have (on average 1.3245033112582782) internal successors, (200), 155 states have internal predecessors, (200), 51 states have call successors, (51), 9 states have call predecessors, (51), 9 states have return successors, (57), 50 states have call predecessors, (57), 50 states have call successors, (57) [2023-11-29 00:59:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 308 transitions. [2023-11-29 00:59:53,637 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 308 transitions. Word has length 113 [2023-11-29 00:59:53,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:53,637 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 308 transitions. [2023-11-29 00:59:53,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-29 00:59:53,637 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 308 transitions. [2023-11-29 00:59:53,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 00:59:53,639 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:53,639 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 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-29 00:59:53,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 00:59:53,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 00:59:53,840 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 00:59:53,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1377138179, now seen corresponding path program 1 times [2023-11-29 00:59:53,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:59:53,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816673482] [2023-11-29 00:59:53,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:53,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:59:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:54,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:59:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:55,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:59:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:55,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 00:59:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:55,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:59:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:55,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:59:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:55,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:59:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:55,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 00:59:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:55,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:59:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2023-11-29 00:59:55,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:59:55,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816673482] [2023-11-29 00:59:55,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816673482] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:59:55,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694545542] [2023-11-29 00:59:55,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:55,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:59:55,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:59:55,413 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:59:55,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 00:59:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:55,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 00:59:56,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:59:56,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-29 00:59:56,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:59:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-11-29 00:59:56,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:59:56,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-11-29 00:59:56,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-11-29 00:59:56,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-11-29 00:59:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2023-11-29 00:59:56,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694545542] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:59:56,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:59:56,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 31 [2023-11-29 00:59:56,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226845511] [2023-11-29 00:59:56,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:59:56,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 00:59:56,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:59:56,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 00:59:56,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2023-11-29 00:59:56,865 INFO L87 Difference]: Start difference. First operand 215 states and 308 transitions. Second operand has 31 states, 29 states have (on average 3.896551724137931) internal successors, (113), 26 states have internal predecessors, (113), 13 states have call successors, (27), 13 states have call predecessors, (27), 9 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) [2023-11-29 01:00:02,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:00:06,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:00:10,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:00:14,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:00:18,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:00:23,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:00:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:00:45,156 INFO L93 Difference]: Finished difference Result 1503 states and 2264 transitions. [2023-11-29 01:00:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2023-11-29 01:00:45,157 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 3.896551724137931) internal successors, (113), 26 states have internal predecessors, (113), 13 states have call successors, (27), 13 states have call predecessors, (27), 9 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) Word has length 111 [2023-11-29 01:00:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:00:45,166 INFO L225 Difference]: With dead ends: 1503 [2023-11-29 01:00:45,167 INFO L226 Difference]: Without dead ends: 1104 [2023-11-29 01:00:45,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7896 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=3319, Invalid=19633, Unknown=0, NotChecked=0, Total=22952 [2023-11-29 01:00:45,180 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 3615 mSDsluCounter, 4557 mSDsCounter, 0 mSdLazyCounter, 7431 mSolverCounterSat, 2153 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3635 SdHoareTripleChecker+Valid, 4992 SdHoareTripleChecker+Invalid, 9589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2153 IncrementalHoareTripleChecker+Valid, 7431 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:00:45,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3635 Valid, 4992 Invalid, 9589 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2153 Valid, 7431 Invalid, 5 Unknown, 0 Unchecked, 35.3s Time] [2023-11-29 01:00:45,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2023-11-29 01:00:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 981. [2023-11-29 01:00:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 674 states have (on average 1.3798219584569733) internal successors, (930), 681 states have internal predecessors, (930), 248 states have call successors, (248), 49 states have call predecessors, (248), 55 states have return successors, (289), 250 states have call predecessors, (289), 241 states have call successors, (289) [2023-11-29 01:00:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1467 transitions. [2023-11-29 01:00:45,342 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1467 transitions. Word has length 111 [2023-11-29 01:00:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:00:45,342 INFO L495 AbstractCegarLoop]: Abstraction has 981 states and 1467 transitions. [2023-11-29 01:00:45,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 3.896551724137931) internal successors, (113), 26 states have internal predecessors, (113), 13 states have call successors, (27), 13 states have call predecessors, (27), 9 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) [2023-11-29 01:00:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1467 transitions. [2023-11-29 01:00:45,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 01:00:45,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:00:45,345 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 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-29 01:00:45,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 01:00:45,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 01:00:45,547 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 01:00:45,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:00:45,547 INFO L85 PathProgramCache]: Analyzing trace with hash 71069961, now seen corresponding path program 1 times [2023-11-29 01:00:45,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:00:45,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667440369] [2023-11-29 01:00:45,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:00:45,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:00:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:46,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:00:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:46,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:00:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:46,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 01:00:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:46,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:00:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:46,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:00:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:46,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:00:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:46,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:00:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:46,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 01:00:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-11-29 01:00:46,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:00:46,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667440369] [2023-11-29 01:00:46,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667440369] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:00:46,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908652218] [2023-11-29 01:00:46,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:00:46,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:00:46,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:00:46,950 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:00:46,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 01:00:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:47,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 01:00:47,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:00:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-11-29 01:00:47,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:00:47,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908652218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:00:47,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:00:47,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 16 [2023-11-29 01:00:47,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839294409] [2023-11-29 01:00:47,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:00:47,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:00:47,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:00:47,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:00:47,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-11-29 01:00:47,769 INFO L87 Difference]: Start difference. First operand 981 states and 1467 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 01:00:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:00:48,782 INFO L93 Difference]: Finished difference Result 2667 states and 4062 transitions. [2023-11-29 01:00:48,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:00:48,783 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 111 [2023-11-29 01:00:48,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:00:48,794 INFO L225 Difference]: With dead ends: 2667 [2023-11-29 01:00:48,794 INFO L226 Difference]: Without dead ends: 1732 [2023-11-29 01:00:48,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2023-11-29 01:00:48,801 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 312 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:00:48,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 608 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 01:00:48,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2023-11-29 01:00:48,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1478. [2023-11-29 01:00:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 1029 states have (on average 1.2973760932944607) internal successors, (1335), 1011 states have internal predecessors, (1335), 335 states have call successors, (335), 68 states have call predecessors, (335), 110 states have return successors, (531), 398 states have call predecessors, (531), 328 states have call successors, (531) [2023-11-29 01:00:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2201 transitions. [2023-11-29 01:00:48,998 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2201 transitions. Word has length 111 [2023-11-29 01:00:48,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:00:48,999 INFO L495 AbstractCegarLoop]: Abstraction has 1478 states and 2201 transitions. [2023-11-29 01:00:48,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 01:00:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2201 transitions. [2023-11-29 01:00:49,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 01:00:49,001 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:00:49,001 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 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-29 01:00:49,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 01:00:49,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:00:49,202 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 01:00:49,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:00:49,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2024196969, now seen corresponding path program 1 times [2023-11-29 01:00:49,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:00:49,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342970285] [2023-11-29 01:00:49,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:00:49,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:00:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:50,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:00:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:50,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:00:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:50,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 01:00:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:50,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:00:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:50,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:00:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:51,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:00:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:51,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:00:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:51,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 01:00:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-11-29 01:00:51,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:00:51,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342970285] [2023-11-29 01:00:51,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342970285] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:00:51,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554855150] [2023-11-29 01:00:51,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:00:51,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:00:51,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:00:51,140 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:00:51,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 01:00:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:51,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 01:00:51,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:00:51,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:00:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 51 proven. 14 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-11-29 01:00:52,509 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:00:53,466 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-29 01:00:53,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554855150] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:00:53,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:00:53,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 5] total 28 [2023-11-29 01:00:53,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218343522] [2023-11-29 01:00:53,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:00:53,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 01:00:53,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:00:53,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 01:00:53,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2023-11-29 01:00:53,470 INFO L87 Difference]: Start difference. First operand 1478 states and 2201 transitions. Second operand has 28 states, 24 states have (on average 5.125) internal successors, (123), 21 states have internal predecessors, (123), 9 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (19), 11 states have call predecessors, (19), 9 states have call successors, (19) [2023-11-29 01:00:54,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:01:00,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:01:04,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:01:10,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:01:10,179 INFO L93 Difference]: Finished difference Result 3528 states and 5187 transitions. [2023-11-29 01:01:10,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 01:01:10,180 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 5.125) internal successors, (123), 21 states have internal predecessors, (123), 9 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (19), 11 states have call predecessors, (19), 9 states have call successors, (19) Word has length 113 [2023-11-29 01:01:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:01:10,197 INFO L225 Difference]: With dead ends: 3528 [2023-11-29 01:01:10,197 INFO L226 Difference]: Without dead ends: 2112 [2023-11-29 01:01:10,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=606, Invalid=2364, Unknown=0, NotChecked=0, Total=2970 [2023-11-29 01:01:10,210 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 823 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 3146 mSolverCounterSat, 688 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 3836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 3146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:01:10,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 1219 Invalid, 3836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 3146 Invalid, 2 Unknown, 0 Unchecked, 14.7s Time] [2023-11-29 01:01:10,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2023-11-29 01:01:10,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 1761. [2023-11-29 01:01:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1244 states have (on average 1.27491961414791) internal successors, (1586), 1195 states have internal predecessors, (1586), 372 states have call successors, (372), 79 states have call predecessors, (372), 141 states have return successors, (623), 486 states have call predecessors, (623), 365 states have call successors, (623) [2023-11-29 01:01:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2581 transitions. [2023-11-29 01:01:10,499 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2581 transitions. Word has length 113 [2023-11-29 01:01:10,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:01:10,499 INFO L495 AbstractCegarLoop]: Abstraction has 1761 states and 2581 transitions. [2023-11-29 01:01:10,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 5.125) internal successors, (123), 21 states have internal predecessors, (123), 9 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (19), 11 states have call predecessors, (19), 9 states have call successors, (19) [2023-11-29 01:01:10,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2581 transitions. [2023-11-29 01:01:10,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 01:01:10,501 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:01:10,501 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 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-29 01:01:10,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-29 01:01:10,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:01:10,702 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 01:01:10,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:01:10,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1426764825, now seen corresponding path program 1 times [2023-11-29 01:01:10,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:01:10,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412720266] [2023-11-29 01:01:10,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:01:10,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:01:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:13,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:01:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:13,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:01:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:13,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 01:01:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:13,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:01:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:13,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:01:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:13,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:01:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:13,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 01:01:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:13,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 01:01:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-11-29 01:01:13,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:01:13,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412720266] [2023-11-29 01:01:13,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412720266] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:01:13,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679678237] [2023-11-29 01:01:13,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:01:13,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:01:13,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:01:13,332 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:01:13,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 01:01:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:13,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 01:01:13,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:01:14,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:01:14,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-29 01:01:14,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-29 01:01:14,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:01:14,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 01:01:14,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:01:14,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 01:01:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 49 proven. 65 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 01:01:14,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:01:15,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679678237] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:01:15,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:01:15,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 27 [2023-11-29 01:01:15,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571711539] [2023-11-29 01:01:15,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:01:15,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 01:01:15,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:01:15,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 01:01:15,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2023-11-29 01:01:15,256 INFO L87 Difference]: Start difference. First operand 1761 states and 2581 transitions. Second operand has 28 states, 25 states have (on average 4.92) internal successors, (123), 22 states have internal predecessors, (123), 4 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16) [2023-11-29 01:01:20,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:01:25,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:01:30,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:01:32,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:01:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:01:39,014 INFO L93 Difference]: Finished difference Result 3433 states and 4889 transitions. [2023-11-29 01:01:39,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 01:01:39,014 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 4.92) internal successors, (123), 22 states have internal predecessors, (123), 4 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16) Word has length 113 [2023-11-29 01:01:39,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:01:39,030 INFO L225 Difference]: With dead ends: 3433 [2023-11-29 01:01:39,030 INFO L226 Difference]: Without dead ends: 3147 [2023-11-29 01:01:39,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=556, Invalid=2750, Unknown=0, NotChecked=0, Total=3306 [2023-11-29 01:01:39,035 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 1343 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 2242 mSolverCounterSat, 794 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 3038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 2242 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:01:39,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 1394 Invalid, 3038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 2242 Invalid, 2 Unknown, 0 Unchecked, 21.1s Time] [2023-11-29 01:01:39,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2023-11-29 01:01:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 2973. [2023-11-29 01:01:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2973 states, 2096 states have (on average 1.254293893129771) internal successors, (2629), 2035 states have internal predecessors, (2629), 612 states have call successors, (612), 144 states have call predecessors, (612), 261 states have return successors, (1021), 793 states have call predecessors, (1021), 598 states have call successors, (1021) [2023-11-29 01:01:39,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2973 states to 2973 states and 4262 transitions. [2023-11-29 01:01:39,487 INFO L78 Accepts]: Start accepts. Automaton has 2973 states and 4262 transitions. Word has length 113 [2023-11-29 01:01:39,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:01:39,488 INFO L495 AbstractCegarLoop]: Abstraction has 2973 states and 4262 transitions. [2023-11-29 01:01:39,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 4.92) internal successors, (123), 22 states have internal predecessors, (123), 4 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16) [2023-11-29 01:01:39,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2973 states and 4262 transitions. [2023-11-29 01:01:39,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 01:01:39,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:01:39,489 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 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] [2023-11-29 01:01:39,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 01:01:39,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:01:39,690 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-11-29 01:01:39,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:01:39,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1280036879, now seen corresponding path program 1 times [2023-11-29 01:01:39,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:01:39,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780065614] [2023-11-29 01:01:39,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:01:39,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:01:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:01:40,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:01:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:01:40,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:01:40,481 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:01:40,482 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-11-29 01:01:40,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-11-29 01:01:40,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-11-29 01:01:40,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-11-29 01:01:40,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-11-29 01:01:40,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-11-29 01:01:40,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-11-29 01:01:40,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-11-29 01:01:40,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-11-29 01:01:40,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-11-29 01:01:40,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_unlockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-11-29 01:01:40,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_unlockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-11-29 01:01:40,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-11-29 01:01:40,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-11-29 01:01:40,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-11-29 01:01:40,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-11-29 01:01:40,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 01:01:40,490 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:01:40,494 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:01:40,566 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 01:01:40,571 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 01:01:40,572 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 01:01:40,580 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret32 could not be translated [2023-11-29 01:01:40,583 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret60 [2023-11-29 01:01:40,587 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated [2023-11-29 01:01:40,588 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated [2023-11-29 01:01:40,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post23 could not be translated [2023-11-29 01:01:40,590 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem22 could not be translated [2023-11-29 01:01:40,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:01:40 BoogieIcfgContainer [2023-11-29 01:01:40,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:01:40,611 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:01:40,611 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:01:40,611 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:01:40,612 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:58:47" (3/4) ... [2023-11-29 01:01:40,612 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 01:01:40,650 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 01:01:40,651 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 01:01:40,652 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 01:01:40,656 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret32 could not be translated [2023-11-29 01:01:40,657 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret60 [2023-11-29 01:01:40,659 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated [2023-11-29 01:01:40,659 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated [2023-11-29 01:01:40,660 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post23 could not be translated [2023-11-29 01:01:40,661 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem22 could not be translated [2023-11-29 01:01:40,719 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 01:01:40,719 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:01:40,719 INFO L158 Benchmark]: Toolchain (without parser) took 178581.19ms. Allocated memory was 176.2MB in the beginning and 457.2MB in the end (delta: 281.0MB). Free memory was 138.7MB in the beginning and 209.0MB in the end (delta: -70.3MB). Peak memory consumption was 210.4MB. Max. memory is 16.1GB. [2023-11-29 01:01:40,720 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:01:40,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.05ms. Allocated memory is still 176.2MB. Free memory was 138.3MB in the beginning and 131.2MB in the end (delta: 7.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 01:01:40,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.88ms. Allocated memory is still 176.2MB. Free memory was 131.2MB in the beginning and 126.1MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 01:01:40,721 INFO L158 Benchmark]: Boogie Preprocessor took 123.51ms. Allocated memory is still 176.2MB. Free memory was 126.1MB in the beginning and 119.0MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 01:01:40,721 INFO L158 Benchmark]: RCFGBuilder took 4958.33ms. Allocated memory is still 176.2MB. Free memory was 119.0MB in the beginning and 116.9MB in the end (delta: 2.1MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2023-11-29 01:01:40,721 INFO L158 Benchmark]: TraceAbstraction took 172785.93ms. Allocated memory was 176.2MB in the beginning and 457.2MB in the end (delta: 281.0MB). Free memory was 116.1MB in the beginning and 223.7MB in the end (delta: -107.5MB). Peak memory consumption was 175.3MB. Max. memory is 16.1GB. [2023-11-29 01:01:40,722 INFO L158 Benchmark]: Witness Printer took 107.97ms. Allocated memory is still 457.2MB. Free memory was 223.7MB in the beginning and 209.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 01:01:40,723 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.16ms. Allocated memory is still 119.5MB. Free memory is still 90.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 527.05ms. Allocated memory is still 176.2MB. Free memory was 138.3MB in the beginning and 131.2MB in the end (delta: 7.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.88ms. Allocated memory is still 176.2MB. Free memory was 131.2MB in the beginning and 126.1MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 123.51ms. Allocated memory is still 176.2MB. Free memory was 126.1MB in the beginning and 119.0MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 4958.33ms. Allocated memory is still 176.2MB. Free memory was 119.0MB in the beginning and 116.9MB in the end (delta: 2.1MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. * TraceAbstraction took 172785.93ms. Allocated memory was 176.2MB in the beginning and 457.2MB in the end (delta: 281.0MB). Free memory was 116.1MB in the beginning and 223.7MB in the end (delta: -107.5MB). Peak memory consumption was 175.3MB. Max. memory is 16.1GB. * Witness Printer took 107.97ms. Allocated memory is still 457.2MB. Free memory was 223.7MB in the beginning and 209.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret60 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem22 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret60 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem22 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 686]: integer overflow possible integer overflow possible We found a FailurePath: [L540] unsigned char __CS_round = 0; [L541] unsigned char __CS_ret = 0; [L542] const unsigned char __CS_ret_PREEMPTED = 0x01; [L543] const unsigned char __CS_ret_ERROR = 0x02; [L544] const unsigned char __CS_ret_FINISHED = 0x04; [L545] unsigned char __CS_error = 0; [L546] unsigned char __CS_thread_index; [L547] unsigned char __CS_thread_allocated[3 +1]; [L547] unsigned char __CS_thread_allocated[3 +1]; [L547] unsigned char __CS_thread_allocated[3 +1]; [L547] unsigned char __CS_thread_allocated[3 +1]; [L547] unsigned char __CS_thread_allocated[3 +1]; [L548] unsigned char __CS_thread_born_round[3 +1]; [L548] unsigned char __CS_thread_born_round[3 +1]; [L548] unsigned char __CS_thread_born_round[3 +1]; [L548] unsigned char __CS_thread_born_round[3 +1]; [L548] unsigned char __CS_thread_born_round[3 +1]; [L549] void *(*__CS_thread[3 +1])(void *); [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L551] const unsigned char __THREAD_UNUSED = 0x00; [L552] const unsigned char __THREAD_RUNNING = 0x01; [L553] const unsigned char __THREAD_FINISHED = 0x02; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L674] unsigned char mutex[2]; [L674] unsigned char mutex[2]; [L674] unsigned char mutex[2]; [L675] int data[2] = {0}; [L675] int data[2] = {0}; [L675] int data[2] = {0}; [L680] union __CS__u __CS_u; [L743] unsigned char __CS_cp___CS_thread_status[2][3 +1]; [L744] unsigned char *__CS_cp___CS_thread_lockedon[2][3 +1]; [L745] unsigned char __CS_cp_mutex[2]; [L746] int __CS_cp_data[2]; [L747] int i = 0; VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=0, mutex={7:0}] [L747] COND TRUE i < 2 [L748] int j = 0; VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=0, j=0, mutex={7:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=0, j=1, mutex={7:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=0, j=2, mutex={7:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=0, j=3, mutex={7:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=0, j=4, mutex={7:0}] [L748] COND FALSE !(j < 3 +1) VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=0, j=4, mutex={7:0}] [L752] __CS_cp_mutex[i] = __VERIFIER_nondet_uchar() [L753] __CS_cp_data[i] = __VERIFIER_nondet_int() [L747] ++i VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=1, mutex={7:0}] [L747] COND TRUE i < 2 [L748] int j = 0; VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=1, j=0, mutex={7:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=1, j=1, mutex={7:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=1, j=2, mutex={7:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=1, j=3, mutex={7:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=1, j=4, mutex={7:0}] [L748] COND FALSE !(j < 3 +1) VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=1, j=4, mutex={7:0}] [L752] __CS_cp_mutex[i] = __VERIFIER_nondet_uchar() [L753] __CS_cp_data[i] = __VERIFIER_nondet_int() [L747] ++i VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=2, mutex={7:0}] [L747] COND FALSE !(i < 2) VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, i=2, mutex={7:0}] [L755] EXPR __CS_cp___CS_thread_status[1][0] [L755] __CS_thread_status[1][0] = __CS_cp___CS_thread_status[1][0] [L756] EXPR __CS_cp___CS_thread_status[1][1] [L756] __CS_thread_status[1][1] = __CS_cp___CS_thread_status[1][1] [L757] EXPR __CS_cp___CS_thread_status[1][2] [L757] __CS_thread_status[1][2] = __CS_cp___CS_thread_status[1][2] [L758] EXPR __CS_cp___CS_thread_status[1][3] [L758] __CS_thread_status[1][3] = __CS_cp___CS_thread_status[1][3] [L759] EXPR __CS_cp___CS_thread_lockedon[1][0] [L759] __CS_thread_lockedon[1][0] = __CS_cp___CS_thread_lockedon[1][0] [L760] EXPR __CS_cp___CS_thread_lockedon[1][1] [L760] __CS_thread_lockedon[1][1] = __CS_cp___CS_thread_lockedon[1][1] [L761] EXPR __CS_cp___CS_thread_lockedon[1][2] [L761] __CS_thread_lockedon[1][2] = __CS_cp___CS_thread_lockedon[1][2] [L762] EXPR __CS_cp___CS_thread_lockedon[1][3] [L762] __CS_thread_lockedon[1][3] = __CS_cp___CS_thread_lockedon[1][3] [L763] EXPR __CS_cp_mutex[1] [L763] mutex[1] = __CS_cp_mutex[1] [L764] EXPR __CS_cp_data[1] [L764] data[1] = __CS_cp_data[1] [L765] __CS_round = 0 [L766] __CS_thread_index = 0 [L767] __CS_thread_born_round[0] = __CS_round [L768] __CS_thread_status[0][0] = __THREAD_RUNNING [L769] __CS_thread[0] = main_thread [L770] __CS_thread_allocated[0] = 1 [L771] EXPR __CS_thread_allocated[0] VAL [__CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L771] COND TRUE __CS_thread_allocated[0] == 1 [L772] EXPR __CS_thread_born_round[0] [L772] __CS_round = __CS_thread_born_round[0] [L773] __CS_ret = 0 VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L774] CALL __CS_thread[0](0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L722] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, k=0, mutex={7:0}] [L562] __CS_round += k [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L722] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}] [L722] COND FALSE !(__CS_ret != 0) [L723] CALL __CS_pthread_mutex_init(&mutex[__CS_round], 0) [L567] return 0; [L723] RET __CS_pthread_mutex_init(&mutex[__CS_round], 0) [L724] unsigned char t1; [L725] unsigned char t2; [L726] unsigned char t3; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}, t1={17:0}, t2={18:0}, t3={9:0}] [L727] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, k=1, mutex={7:0}] [L562] __CS_round += k [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L727] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}, t1={17:0}, t2={18:0}, t3={9:0}] [L727] COND FALSE !(__CS_ret != 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}, t1={17:0}, t2={18:0}, t3={9:0}] [L728] CALL __CS_pthread_create(&t1, 0, thread1, 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, attr={0:0}, data={8:0}, id1={17:0}, mutex={7:0}, t1={-1:0}] [L662] COND FALSE !(__CS_thread_index == 3) [L666] __CS_thread_index++ [L667] __CS_thread_allocated[__CS_thread_index] = 1 [L668] __CS_thread_born_round[__CS_thread_index] = __CS_round [L669] __CS_thread[__CS_thread_index] = t1 [L670] __CS_thread_status[__CS_round][__CS_thread_index] = __THREAD_RUNNING [L671] *id1 = __CS_thread_index [L672] return __CS_thread_index; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, \result=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, attr={0:0}, attr={0:0}, data={8:0}, id1={17:0}, id1={17:0}, mutex={7:0}, t1={-1:0}, t1={-1:0}] [L728] RET __CS_pthread_create(&t1, 0, thread1, 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}, t1={17:0}, t2={18:0}, t3={9:0}] [L729] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, k=0, mutex={7:0}] [L562] __CS_round += k [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L729] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}, t1={17:0}, t2={18:0}, t3={9:0}] [L729] COND TRUE __CS_ret != 0 [L729] return 0; [L729] return 0; [L729] return 0; [L729] return 0; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, \result={0:0}, __CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}] [L774] RET __CS_thread[0](0) VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L775] COND FALSE !(__CS_ret!=__CS_ret_PREEMPTED) VAL [__CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L777] EXPR __CS_thread_allocated[1] VAL [__CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L777] COND TRUE __CS_thread_allocated[1] == 1 [L778] EXPR __CS_thread_born_round[1] [L778] __CS_round = __CS_thread_born_round[1] [L779] __CS_ret = 0 VAL [__CS_cp___CS_thread_lockedon={14:0}, __CS_cp___CS_thread_status={13:0}, __CS_cp_data={15:0}, __CS_cp_mutex={11:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L780] CALL __CS_thread[1](0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L683] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, k=0, mutex={7:0}] [L562] __CS_round += k [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L683] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}] [L683] COND FALSE !(__CS_ret != 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}] [L684] CALL __CS_pthread_mutex_lock(&mutex[__CS_round]) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, lock={7:1}, mutex={7:0}] [L580] EXPR \read(*lock) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, lock={7:1}, lock={7:1}, mutex={7:0}] [L580] COND TRUE *lock == 0 [L580] EXPR __CS_thread_index+1 [L580] *lock = (__CS_thread_index+1) [L582] return 0; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, \result=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, lock={7:1}, lock={7:1}, mutex={7:0}] [L684] RET __CS_pthread_mutex_lock(&mutex[__CS_round]) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}] [L685] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, mutex={7:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={8:0}, k=0, mutex={7:0}] [L562] __CS_round += k [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L685] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}] [L685] COND FALSE !(__CS_ret != 0) [L686] EXPR data[__CS_round] [L686] data[__CS_round]++ VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={6:0}, __CS_thread_status={5:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, arg={0:0}, arg={0:0}, data={8:0}, mutex={7:0}] - UnprovableResult [Line: 580]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 183 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 172.6s, OverallIterations: 22, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 144.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 9004 SdHoareTripleChecker+Valid, 125.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8943 mSDsluCounter, 18484 SdHoareTripleChecker+Invalid, 122.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14054 mSDsCounter, 5285 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18552 IncrementalHoareTripleChecker+Invalid, 23851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5285 mSolverCounterUnsat, 4430 mSDtfsCounter, 18552 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1565 GetRequests, 1162 SyntacticMatches, 5 SemanticMatches, 398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9711 ImplicationChecksByTransitivity, 20.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2973occurred in iteration=21, InterpolantAutomatonStates: 322, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 1067 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 2104 NumberOfCodeBlocks, 2104 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2281 ConstructedInterpolants, 0 QuantifiedInterpolants, 11114 SizeOfPredicates, 42 NumberOfNonLiveVariables, 8628 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 36 InterpolantComputations, 16 PerfectInterpolantSequences, 3022/3212 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 01:01:40,753 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26a3973a-3bb0-489b-92a2-79f72fb23b66/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)