./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/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_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7c314eef3d472fe4a1a0388d2c5f5a188709ac797267103fd11452d71371ead3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:12:19,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:12:19,480 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 04:12:19,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:12:19,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:12:19,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:12:19,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:12:19,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:12:19,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:12:19,511 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:12:19,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:12:19,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:12:19,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:12:19,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:12:19,513 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:12:19,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:12:19,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:12:19,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:12:19,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:12:19,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:12:19,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:12:19,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:12:19,518 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:12:19,518 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:12:19,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:12:19,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:12:19,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:12:19,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:12:19,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:12:19,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:12:19,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:12:19,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:12:19,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:12:19,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:12:19,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:12:19,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:12:19,523 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:12:19,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:12:19,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:12:19,523 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_4fb9737f-2b7d-494c-a3eb-ae61b5554717/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_4fb9737f-2b7d-494c-a3eb-ae61b5554717/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c314eef3d472fe4a1a0388d2c5f5a188709ac797267103fd11452d71371ead3 [2023-11-29 04:12:19,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:12:19,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:12:19,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:12:19,765 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:12:19,765 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:12:19,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2023-11-29 04:12:22,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:12:22,674 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:12:22,674 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2023-11-29 04:12:22,681 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/data/4e140f437/0f7a111921744e9883117ea1e47c9181/FLAGd54d4061e [2023-11-29 04:12:22,691 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/data/4e140f437/0f7a111921744e9883117ea1e47c9181 [2023-11-29 04:12:22,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:12:22,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:12:22,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:12:22,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:12:22,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:12:22,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:12:22" (1/1) ... [2023-11-29 04:12:22,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f0007f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:22, skipping insertion in model container [2023-11-29 04:12:22,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:12:22" (1/1) ... [2023-11-29 04:12:22,723 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:12:22,839 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c[1260,1273] [2023-11-29 04:12:22,882 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:12:22,892 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:12:22,903 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c[1260,1273] [2023-11-29 04:12:22,930 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:12:22,943 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:12:22,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:22 WrapperNode [2023-11-29 04:12:22,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:12:22,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:12:22,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:12:22,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:12:22,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:22" (1/1) ... [2023-11-29 04:12:22,959 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:22" (1/1) ... [2023-11-29 04:12:22,999 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 195 [2023-11-29 04:12:22,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:12:23,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:12:23,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:12:23,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:12:23,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:22" (1/1) ... [2023-11-29 04:12:23,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:22" (1/1) ... [2023-11-29 04:12:23,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:22" (1/1) ... [2023-11-29 04:12:23,032 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 04:12:23,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:22" (1/1) ... [2023-11-29 04:12:23,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:22" (1/1) ... [2023-11-29 04:12:23,043 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:22" (1/1) ... [2023-11-29 04:12:23,047 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:22" (1/1) ... [2023-11-29 04:12:23,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:22" (1/1) ... [2023-11-29 04:12:23,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:22" (1/1) ... [2023-11-29 04:12:23,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:12:23,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:12:23,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:12:23,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:12:23,060 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:22" (1/1) ... [2023-11-29 04:12:23,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:12:23,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:23,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:12:23,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:12:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:12:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:12:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:12:23,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:12:23,213 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:12:23,216 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:12:23,460 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:12:23,485 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:12:23,485 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:12:23,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:12:23 BoogieIcfgContainer [2023-11-29 04:12:23,486 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:12:23,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:12:23,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:12:23,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:12:23,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:12:22" (1/3) ... [2023-11-29 04:12:23,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc941cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:12:23, skipping insertion in model container [2023-11-29 04:12:23,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:22" (2/3) ... [2023-11-29 04:12:23,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc941cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:12:23, skipping insertion in model container [2023-11-29 04:12:23,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:12:23" (3/3) ... [2023-11-29 04:12:23,497 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2023-11-29 04:12:23,514 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:12:23,515 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:12:23,555 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:12:23,561 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;@7fc50c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:12:23,561 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:12:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 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 04:12:23,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 04:12:23,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:23,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:23,571 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:12:23,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:23,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1606432722, now seen corresponding path program 1 times [2023-11-29 04:12:23,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:23,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401441927] [2023-11-29 04:12:23,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:23,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:23,973 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 04:12:23,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:23,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401441927] [2023-11-29 04:12:23,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401441927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:23,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:23,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:12:23,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441554368] [2023-11-29 04:12:23,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:23,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:12:23,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:24,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:12:24,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:12:24,005 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 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) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 04:12:24,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:24,043 INFO L93 Difference]: Finished difference Result 48 states and 76 transitions. [2023-11-29 04:12:24,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:12:24,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2023-11-29 04:12:24,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:24,051 INFO L225 Difference]: With dead ends: 48 [2023-11-29 04:12:24,051 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 04:12:24,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:12:24,055 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:24,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 94 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:12:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 04:12:24,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-29 04:12:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:24,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2023-11-29 04:12:24,082 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 14 [2023-11-29 04:12:24,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:24,082 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2023-11-29 04:12:24,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 04:12:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2023-11-29 04:12:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 04:12:24,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:24,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:24,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:12:24,084 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:12:24,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:24,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1741918178, now seen corresponding path program 1 times [2023-11-29 04:12:24,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:24,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105936749] [2023-11-29 04:12:24,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:24,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:24,194 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 04:12:24,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:24,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105936749] [2023-11-29 04:12:24,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105936749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:24,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:24,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:12:24,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804632361] [2023-11-29 04:12:24,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:24,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:12:24,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:24,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:12:24,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:12:24,198 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:24,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:24,224 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2023-11-29 04:12:24,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:12:24,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 04:12:24,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:24,226 INFO L225 Difference]: With dead ends: 51 [2023-11-29 04:12:24,226 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 04:12:24,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:12:24,228 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:24,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 92 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:12:24,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 04:12:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-11-29 04:12:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 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 04:12:24,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2023-11-29 04:12:24,234 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2023-11-29 04:12:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:24,235 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2023-11-29 04:12:24,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2023-11-29 04:12:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 04:12:24,236 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:24,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:24,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:12:24,237 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:12:24,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:24,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2045543736, now seen corresponding path program 1 times [2023-11-29 04:12:24,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:24,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605674675] [2023-11-29 04:12:24,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:24,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:24,549 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 04:12:24,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:24,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605674675] [2023-11-29 04:12:24,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605674675] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:24,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:24,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:12:24,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140103843] [2023-11-29 04:12:24,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:24,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:12:24,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:24,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:12:24,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:12:24,553 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 04:12:24,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:24,738 INFO L93 Difference]: Finished difference Result 80 states and 114 transitions. [2023-11-29 04:12:24,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:12:24,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2023-11-29 04:12:24,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:24,740 INFO L225 Difference]: With dead ends: 80 [2023-11-29 04:12:24,740 INFO L226 Difference]: Without dead ends: 56 [2023-11-29 04:12:24,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:12:24,742 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 152 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:24,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 123 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:12:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-29 04:12:24,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 33. [2023-11-29 04:12:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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 04:12:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2023-11-29 04:12:24,750 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 16 [2023-11-29 04:12:24,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:24,750 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2023-11-29 04:12:24,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 04:12:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2023-11-29 04:12:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 04:12:24,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:24,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:24,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:12:24,752 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:12:24,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:24,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1682406840, now seen corresponding path program 1 times [2023-11-29 04:12:24,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:24,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83090618] [2023-11-29 04:12:24,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:24,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:24,956 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 04:12:24,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:24,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83090618] [2023-11-29 04:12:24,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83090618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:24,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:24,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:12:24,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666622719] [2023-11-29 04:12:24,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:24,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:12:24,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:24,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:12:24,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:12:24,959 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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 04:12:25,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:25,192 INFO L93 Difference]: Finished difference Result 97 states and 137 transitions. [2023-11-29 04:12:25,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:12:25,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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 04:12:25,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:25,194 INFO L225 Difference]: With dead ends: 97 [2023-11-29 04:12:25,194 INFO L226 Difference]: Without dead ends: 73 [2023-11-29 04:12:25,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2023-11-29 04:12:25,196 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 235 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:25,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 186 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:12:25,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-29 04:12:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 36. [2023-11-29 04:12:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 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 04:12:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2023-11-29 04:12:25,204 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 17 [2023-11-29 04:12:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:25,204 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2023-11-29 04:12:25,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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 04:12:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2023-11-29 04:12:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 04:12:25,205 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:25,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:25,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:12:25,206 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:12:25,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:25,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2075433850, now seen corresponding path program 1 times [2023-11-29 04:12:25,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:25,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616586374] [2023-11-29 04:12:25,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:25,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:25,461 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 04:12:25,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:25,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616586374] [2023-11-29 04:12:25,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616586374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:25,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:25,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:12:25,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73178678] [2023-11-29 04:12:25,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:25,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:12:25,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:25,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:12:25,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:12:25,464 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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 04:12:25,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:25,758 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2023-11-29 04:12:25,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:12:25,759 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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 04:12:25,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:25,760 INFO L225 Difference]: With dead ends: 85 [2023-11-29 04:12:25,760 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 04:12:25,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:12:25,761 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 179 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:25,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 172 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:12:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 04:12:25,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2023-11-29 04:12:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 38 states have internal predecessors, (55), 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 04:12:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2023-11-29 04:12:25,769 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 17 [2023-11-29 04:12:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:25,770 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2023-11-29 04:12:25,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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 04:12:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2023-11-29 04:12:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 04:12:25,771 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:25,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:25,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:12:25,772 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:12:25,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:25,772 INFO L85 PathProgramCache]: Analyzing trace with hash -300426488, now seen corresponding path program 1 times [2023-11-29 04:12:25,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:25,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487545725] [2023-11-29 04:12:25,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:25,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:12:25,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:12:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:12:25,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:12:25,838 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:12:25,839 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:12:25,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:12:25,843 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-29 04:12:25,846 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:12:25,867 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 04:12:25,868 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 04:12:25,870 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet21 could not be translated [2023-11-29 04:12:25,872 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated [2023-11-29 04:12:25,874 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated [2023-11-29 04:12:25,874 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet24 could not be translated [2023-11-29 04:12:25,876 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-29 04:12:25,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:12:25 BoogieIcfgContainer [2023-11-29 04:12:25,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:12:25,886 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:12:25,886 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:12:25,886 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:12:25,887 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:12:23" (3/4) ... [2023-11-29 04:12:25,889 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:12:25,890 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:12:25,890 INFO L158 Benchmark]: Toolchain (without parser) took 3196.24ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 108.2MB in the beginning and 129.4MB in the end (delta: -21.3MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2023-11-29 04:12:25,891 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 107.0MB. Free memory is still 60.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:12:25,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.20ms. Allocated memory is still 153.1MB. Free memory was 108.2MB in the beginning and 95.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 04:12:25,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.85ms. Allocated memory is still 153.1MB. Free memory was 95.5MB in the beginning and 92.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:12:25,892 INFO L158 Benchmark]: Boogie Preprocessor took 57.99ms. Allocated memory is still 153.1MB. Free memory was 92.0MB in the beginning and 88.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:12:25,892 INFO L158 Benchmark]: RCFGBuilder took 426.99ms. Allocated memory is still 153.1MB. Free memory was 88.7MB in the beginning and 68.9MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 04:12:25,893 INFO L158 Benchmark]: TraceAbstraction took 2396.85ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 67.7MB in the beginning and 130.5MB in the end (delta: -62.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:12:25,893 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 184.5MB. Free memory was 130.5MB in the beginning and 129.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:12:25,895 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.18ms. Allocated memory is still 107.0MB. Free memory is still 60.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.20ms. Allocated memory is still 153.1MB. Free memory was 108.2MB in the beginning and 95.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.85ms. Allocated memory is still 153.1MB. Free memory was 95.5MB in the beginning and 92.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.99ms. Allocated memory is still 153.1MB. Free memory was 92.0MB in the beginning and 88.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 426.99ms. Allocated memory is still 153.1MB. Free memory was 88.7MB in the beginning and 68.9MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2396.85ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 67.7MB in the beginning and 130.5MB in the end (delta: -62.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 184.5MB. Free memory was 130.5MB in the beginning and 129.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet24 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 98, overapproximation of bitwiseAnd at line 103. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1); [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 2); [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (2 - 1); [L38] const SORT_35 mask_SORT_35 = (SORT_35)-1 >> (sizeof(SORT_35) * 8 - 12); [L39] const SORT_35 msb_SORT_35 = (SORT_35)1 << (12 - 1); [L41] const SORT_6 var_7 = 0; [L42] const SORT_12 var_14 = 0; [L43] const SORT_1 var_19 = 1; [L44] const SORT_6 var_49 = 1; [L45] const SORT_6 var_51 = 4; [L47] SORT_1 input_2; [L48] SORT_3 input_4; [L49] SORT_3 input_5; [L50] SORT_3 input_23; [L51] SORT_3 input_25; [L52] SORT_3 input_27; [L53] SORT_1 input_29; [L54] SORT_3 input_31; [L55] SORT_3 input_33; [L56] SORT_35 input_36; [L57] SORT_35 input_38; [L58] SORT_3 input_40; [L59] SORT_3 input_42; [L60] SORT_3 input_44; [L61] SORT_3 input_46; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_6 VAL [mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L63] SORT_6 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_6; [L65] SORT_6 init_9_arg_1 = var_7; [L66] state_8 = init_9_arg_1 VAL [init_9_arg_1=0, mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, state_8=0, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L69] input_2 = __VERIFIER_nondet_uchar() [L70] input_4 = __VERIFIER_nondet_ushort() [L71] input_5 = __VERIFIER_nondet_ushort() [L72] input_23 = __VERIFIER_nondet_ushort() [L73] input_25 = __VERIFIER_nondet_ushort() [L74] input_27 = __VERIFIER_nondet_ushort() [L75] input_29 = __VERIFIER_nondet_uchar() [L76] input_31 = __VERIFIER_nondet_ushort() [L77] input_33 = __VERIFIER_nondet_ushort() [L78] input_36 = __VERIFIER_nondet_ushort() [L79] input_38 = __VERIFIER_nondet_ushort() [L80] input_40 = __VERIFIER_nondet_ushort() [L81] input_42 = __VERIFIER_nondet_ushort() [L82] input_44 = __VERIFIER_nondet_ushort() [L83] input_46 = __VERIFIER_nondet_ushort() [L86] SORT_6 var_10_arg_0 = state_8; [L87] SORT_1 var_10 = var_10_arg_0 >> 2; [L88] SORT_1 var_11_arg_0 = var_10; [L89] SORT_1 var_11 = ~var_11_arg_0; [L90] SORT_6 var_13_arg_0 = state_8; [L91] SORT_12 var_13 = var_13_arg_0 >> 0; VAL [init_9_arg_1=0, mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, state_8=0, var_10=0, var_10_arg_0=0, var_11=255, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L92] EXPR var_13 & mask_SORT_12 VAL [init_9_arg_1=0, mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, state_8=0, var_10=0, var_10_arg_0=0, var_11=255, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=0, var_19=1, var_49=1, var_51=4, var_7=0] [L92] var_13 = var_13 & mask_SORT_12 [L93] SORT_12 var_15_arg_0 = var_13; [L94] SORT_12 var_15_arg_1 = var_14; [L95] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L96] SORT_1 var_16_arg_0 = var_11; [L97] SORT_1 var_16_arg_1 = var_15; VAL [init_9_arg_1=0, mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, state_8=0, var_10=0, var_10_arg_0=0, var_11=255, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=0, var_15=1, var_15_arg_0=0, var_15_arg_1=0, var_16_arg_0=255, var_16_arg_1=1, var_19=1, var_49=1, var_51=4, var_7=0] [L98] EXPR var_16_arg_0 | var_16_arg_1 VAL [init_9_arg_1=0, mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, state_8=0, var_10=0, var_10_arg_0=0, var_11=255, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=0, var_15=1, var_15_arg_0=0, var_15_arg_1=0, var_16_arg_0=255, var_16_arg_1=1, var_19=1, var_49=1, var_51=4, var_7=0] [L98] SORT_1 var_16 = var_16_arg_0 | var_16_arg_1; [L99] SORT_1 var_20_arg_0 = var_16; [L100] SORT_1 var_20 = ~var_20_arg_0; [L101] SORT_1 var_21_arg_0 = var_19; [L102] SORT_1 var_21_arg_1 = var_20; VAL [init_9_arg_1=0, mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, state_8=0, var_10=0, var_10_arg_0=0, var_11=255, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=0, var_15=1, var_15_arg_0=0, var_15_arg_1=0, var_16=0, var_16_arg_0=255, var_16_arg_1=1, var_19=1, var_20=255, var_20_arg_0=0, var_21_arg_0=1, var_21_arg_1=255, var_49=1, var_51=4, var_7=0] [L103] EXPR var_21_arg_0 & var_21_arg_1 VAL [init_9_arg_1=0, mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, state_8=0, var_10=0, var_10_arg_0=0, var_11=255, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=0, var_15=1, var_15_arg_0=0, var_15_arg_1=0, var_16=0, var_16_arg_0=255, var_16_arg_1=1, var_19=1, var_20=255, var_20_arg_0=0, var_21_arg_0=1, var_21_arg_1=255, var_49=1, var_51=4, var_7=0] [L103] SORT_1 var_21 = var_21_arg_0 & var_21_arg_1; [L104] EXPR var_21 & mask_SORT_1 VAL [init_9_arg_1=0, mask_SORT_12=3, mask_SORT_1=1, mask_SORT_35=4095, mask_SORT_3=65535, mask_SORT_6=7, msb_SORT_12=2, msb_SORT_1=1, msb_SORT_35=2048, msb_SORT_3=32768, msb_SORT_6=4, state_8=0, var_10=0, var_10_arg_0=0, var_11=255, var_11_arg_0=0, var_13=0, var_13_arg_0=0, var_14=0, var_15=1, var_15_arg_0=0, var_15_arg_1=0, var_16=0, var_16_arg_0=255, var_16_arg_1=1, var_19=1, var_20=255, var_20_arg_0=0, var_21=1, var_21_arg_0=1, var_21_arg_1=255, var_49=1, var_51=4, var_7=0] [L104] var_21 = var_21 & mask_SORT_1 [L105] SORT_1 bad_22_arg_0 = var_21; [L106] CALL __VERIFIER_assert(!(bad_22_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 568 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 568 mSDsluCounter, 667 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 498 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 169 IncrementalHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 169 mSDtfsCounter, 169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=5, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 83 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 383 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2023-11-29 04:12:25,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/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_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7c314eef3d472fe4a1a0388d2c5f5a188709ac797267103fd11452d71371ead3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:12:27,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:12:27,847 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-29 04:12:27,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:12:27,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:12:27,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:12:27,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:12:27,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:12:27,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:12:27,882 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:12:27,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:12:27,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:12:27,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:12:27,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:12:27,884 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:12:27,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:12:27,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:12:27,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:12:27,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:12:27,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:12:27,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:12:27,888 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:12:27,888 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:12:27,888 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:12:27,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:12:27,889 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:12:27,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:12:27,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:12:27,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:12:27,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:12:27,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:12:27,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:12:27,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:12:27,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:12:27,892 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:12:27,892 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:12:27,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:12:27,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:12:27,893 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:12:27,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:12:27,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:12:27,894 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:12:27,894 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_4fb9737f-2b7d-494c-a3eb-ae61b5554717/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_4fb9737f-2b7d-494c-a3eb-ae61b5554717/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c314eef3d472fe4a1a0388d2c5f5a188709ac797267103fd11452d71371ead3 [2023-11-29 04:12:28,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:12:28,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:12:28,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:12:28,207 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:12:28,207 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:12:28,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2023-11-29 04:12:30,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:12:31,159 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:12:31,159 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2023-11-29 04:12:31,167 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/data/f9a7cc2dc/e74df18f84884f18ae7e9b72eea032cc/FLAG3819673e8 [2023-11-29 04:12:31,179 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/data/f9a7cc2dc/e74df18f84884f18ae7e9b72eea032cc [2023-11-29 04:12:31,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:12:31,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:12:31,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:12:31,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:12:31,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:12:31,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7395edfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31, skipping insertion in model container [2023-11-29 04:12:31,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,212 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:12:31,339 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c[1260,1273] [2023-11-29 04:12:31,380 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:12:31,390 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:12:31,400 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p3.c[1260,1273] [2023-11-29 04:12:31,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:12:31,439 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:12:31,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31 WrapperNode [2023-11-29 04:12:31,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:12:31,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:12:31,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:12:31,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:12:31,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,477 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 135 [2023-11-29 04:12:31,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:12:31,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:12:31,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:12:31,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:12:31,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,491 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,506 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 04:12:31,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:12:31,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:12:31,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:12:31,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:12:31,544 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (1/1) ... [2023-11-29 04:12:31,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:12:31,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:31,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:12:31,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:12:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:12:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:12:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:12:31,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:12:31,711 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:12:31,713 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:12:31,847 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:12:31,878 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:12:31,878 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:12:31,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:12:31 BoogieIcfgContainer [2023-11-29 04:12:31,879 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:12:31,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:12:31,882 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:12:31,885 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:12:31,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:12:31" (1/3) ... [2023-11-29 04:12:31,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e146374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:12:31, skipping insertion in model container [2023-11-29 04:12:31,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:31" (2/3) ... [2023-11-29 04:12:31,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e146374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:12:31, skipping insertion in model container [2023-11-29 04:12:31,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:12:31" (3/3) ... [2023-11-29 04:12:31,888 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p3.c [2023-11-29 04:12:31,906 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:12:31,906 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:12:31,952 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:12:31,958 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;@7da78896, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:12:31,959 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:12:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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 04:12:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 04:12:31,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:31,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 04:12:31,970 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:12:31,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:31,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-11-29 04:12:31,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:31,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313819472] [2023-11-29 04:12:31,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:31,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:31,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:32,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:32,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 04:12:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:32,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 04:12:32,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:32,323 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 04:12:32,323 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:12:32,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:32,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313819472] [2023-11-29 04:12:32,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313819472] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:32,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:32,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:12:32,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400746843] [2023-11-29 04:12:32,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:32,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:12:32,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:32,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:12:32,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:12:32,355 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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) Second operand has 4 states, 4 states have (on average 1.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 04:12:32,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:32,400 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-11-29 04:12:32,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:12:32,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.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 04:12:32,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:32,408 INFO L225 Difference]: With dead ends: 16 [2023-11-29 04:12:32,408 INFO L226 Difference]: Without dead ends: 9 [2023-11-29 04:12:32,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 04:12:32,413 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:32,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:12:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-11-29 04:12:32,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-11-29 04:12:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 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 04:12:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-11-29 04:12:32,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-11-29 04:12:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:32,437 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-11-29 04:12:32,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.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 04:12:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-11-29 04:12:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:12:32,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:32,438 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-11-29 04:12:32,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:12:32,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:32,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:12:32,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:32,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-11-29 04:12:32,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:32,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648639297] [2023-11-29 04:12:32,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:32,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:32,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:32,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:32,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 04:12:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:32,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 04:12:32,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:32,917 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 04:12:32,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:33,182 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 04:12:33,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:33,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648639297] [2023-11-29 04:12:33,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648639297] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:12:33,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:12:33,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-11-29 04:12:33,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922600179] [2023-11-29 04:12:33,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:12:33,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:12:33,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:33,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:12:33,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:12:33,186 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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 04:12:33,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:33,440 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-11-29 04:12:33,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:12:33,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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 04:12:33,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:33,442 INFO L225 Difference]: With dead ends: 17 [2023-11-29 04:12:33,442 INFO L226 Difference]: Without dead ends: 15 [2023-11-29 04:12:33,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:12:33,444 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:33,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:12:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-29 04:12:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2023-11-29 04:12:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 04:12:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2023-11-29 04:12:33,451 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2023-11-29 04:12:33,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:33,452 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2023-11-29 04:12:33,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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 04:12:33,452 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2023-11-29 04:12:33,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 04:12:33,453 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:33,453 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2023-11-29 04:12:33,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 04:12:33,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:33,654 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:12:33,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash -57678563, now seen corresponding path program 2 times [2023-11-29 04:12:33,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:33,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782085261] [2023-11-29 04:12:33,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:12:33,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:33,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:33,658 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:33,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 04:12:33,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:12:33,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:12:33,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-29 04:12:33,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:34,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:35,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:35,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782085261] [2023-11-29 04:12:35,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782085261] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:12:35,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:12:35,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-11-29 04:12:35,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302299004] [2023-11-29 04:12:35,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:12:35,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:12:35,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:35,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:12:35,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:12:35,408 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 04:12:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:35,651 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2023-11-29 04:12:35,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:12:35,651 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 13 [2023-11-29 04:12:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:35,652 INFO L225 Difference]: With dead ends: 20 [2023-11-29 04:12:35,652 INFO L226 Difference]: Without dead ends: 18 [2023-11-29 04:12:35,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:12:35,654 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:35,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 19 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:12:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-29 04:12:35,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2023-11-29 04:12:35,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 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 04:12:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2023-11-29 04:12:35,661 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2023-11-29 04:12:35,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:35,661 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2023-11-29 04:12:35,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 04:12:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2023-11-29 04:12:35,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 04:12:35,662 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:35,662 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2023-11-29 04:12:35,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 04:12:35,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:35,863 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:12:35,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:35,864 INFO L85 PathProgramCache]: Analyzing trace with hash -310375345, now seen corresponding path program 3 times [2023-11-29 04:12:35,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:12:35,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395524771] [2023-11-29 04:12:35,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:12:35,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:35,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:12:35,866 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:12:35,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 04:12:35,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 04:12:35,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:12:35,956 WARN L260 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 04:12:35,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:12:37,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:42,070 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_12~0#1|)) (.cse5 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_14~0#1|)) (.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_6~0#1|))) (let ((.cse11 (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_7~0#1|)))))))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse30 (_ bv2 32)))))))) (.cse29 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse30)) .cse4))) .cse5))) (and (or (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_19| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_19|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse28 (_ bv0 32)))))))))))))) .cse29) (or (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_19| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_19|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse28 (_ bv1 32)))))))))))))) (not .cse29)))))) (.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_19~0#1|)) (.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_51~0#1|)) (.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_49~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~var_53_arg_2~0#1_18| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_21_arg_0~0#1_19| (_ BitVec 8))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_2~0#1_18|)))))))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse2 .cse8)))))))))) (or (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_19|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse1 (_ bv2 32))))))) (_ bv1 32)))))))))))) (_ bv0 8)) (= .cse2 .cse3) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse2)) .cse4))) .cse5)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse1))))) .cse5)) (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse2 (_ bv2 32))))))) (_ bv1 32)))))))))) .cse0)) (_ bv0 8))))))) (or (and (forall ((|v_ULTIMATE.start_main_~var_53_arg_1~0#1_18| (_ BitVec 8))) (let ((.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_1~0#1_18|)))))))) (or (not (= .cse3 .cse9)) (not (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse9 (_ bv2 32))))))) (_ bv1 32)))))))))))) (_ bv0 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse9)) .cse4))) .cse5))))) (forall ((|v_ULTIMATE.start_main_~var_53_arg_1~0#1_18| (_ BitVec 8))) (let ((.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_1~0#1_18|)))))))) (or (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse10 (_ bv2 32))))))) (_ bv0 32)))))))))) .cse0)) (_ bv0 8))) (not (= .cse3 .cse10)))))) .cse11) (forall ((|v_ULTIMATE.start_main_~var_53_arg_1~0#1_18| (_ BitVec 8))) (let ((.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_1~0#1_18|)))))))) (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse13 .cse8)))))))))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse12))))) .cse5) (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_19| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_19|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse12 (_ bv2 32))))))) (_ bv0 32)))))))))))) (_ bv0 8))) (not (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse13 (_ bv2 32))))))) (_ bv1 32)))))))))))) (_ bv0 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse13)) .cse4))) .cse5)) (= .cse3 .cse13))))) (or .cse11 (and (forall ((|v_ULTIMATE.start_main_~var_53_arg_2~0#1_18| (_ BitVec 8))) (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_2~0#1_18|)))))))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse14)) .cse4))) .cse5)) (not (= .cse14 .cse3)) (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse14 (_ bv2 32))))))) (_ bv1 32)))))))))) .cse0)) (_ bv0 8)))))) (forall ((|v_ULTIMATE.start_main_~var_53_arg_2~0#1_18| (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_2~0#1_18|)))))))) (or (not (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse15 (_ bv2 32))))))) (_ bv0 32)))))))))))) (_ bv0 8))) (not (= .cse15 .cse3))))))) (forall ((|v_ULTIMATE.start_main_~var_53_arg_1~0#1_18| (_ BitVec 8))) (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_1~0#1_18|)))))))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 .cse8)))))))))) (or (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse16 (_ bv2 32))))))) (_ bv0 32)))))))))) .cse0)) (_ bv0 8))) (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_19| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_19|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse17 (_ bv2 32))))))) (_ bv1 32)))))))))) .cse0)) (_ bv0 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse17))))) .cse5)) (= .cse3 .cse16))))) (forall ((|v_ULTIMATE.start_main_~var_53_arg_1~0#1_18| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_1~0#1_18|)))))))) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 .cse8)))))))))) (or (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_19| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_19|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse18 (_ bv2 32))))))) (_ bv1 32)))))))))) .cse0)) (_ bv0 8))) (not (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse19 (_ bv2 32))))))) (_ bv1 32)))))))))))) (_ bv0 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse18))))) .cse5)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse19)) .cse4))) .cse5)) (= .cse3 .cse19))))) (forall ((|v_ULTIMATE.start_main_~var_53_arg_2~0#1_18| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_21_arg_0~0#1_19| (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_2~0#1_18|)))))))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse21 .cse8)))))))))) (or (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_19|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse20 (_ bv2 32))))))) (_ bv1 32)))))))))))) (_ bv0 8)) (= .cse21 .cse3) (not (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse21 (_ bv2 32))))))) (_ bv0 32)))))))))))) (_ bv0 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse20))))) .cse5)))))) (forall ((|v_ULTIMATE.start_main_~var_53_arg_2~0#1_18| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_21_arg_0~0#1_19| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_2~0#1_18|)))))))) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 .cse8)))))))))) (or (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_19|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse22 (_ bv2 32))))))) (_ bv0 32)))))))))))) (_ bv0 8)) (= .cse23 .cse3) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse23)) .cse4))) .cse5)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse22))))) .cse5) (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse23 (_ bv2 32))))))) (_ bv1 32)))))))))) .cse0)) (_ bv0 8))))))) (forall ((|v_ULTIMATE.start_main_~var_53_arg_2~0#1_18| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_21_arg_0~0#1_19| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_2~0#1_18|)))))))) (let ((.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse25 .cse8)))))))))) (or (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_19|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse24 (_ bv2 32))))))) (_ bv0 32)))))))))))) (_ bv0 8)) (= .cse25 .cse3) (not (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse25 (_ bv2 32))))))) (_ bv0 32)))))))))))) (_ bv0 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse24))))) .cse5))))) (forall ((|v_ULTIMATE.start_main_~var_53_arg_1~0#1_18| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_1~0#1_18|)))))))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 .cse8)))))))))) (or (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse26 (_ bv2 32))))))) (_ bv0 32)))))))))) .cse0)) (_ bv0 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse27))))) .cse5) (forall ((|v_ULTIMATE.start_main_~var_21_arg_0~0#1_19| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_21_arg_0~0#1_19|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse27 (_ bv2 32))))))) (_ bv0 32)))))))))))) (_ bv0 8))) (= .cse3 .cse26)))))))) is different from false [2023-11-29 04:12:44,338 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 15 not checked. [2023-11-29 04:12:44,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:12:44,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395524771] [2023-11-29 04:12:44,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395524771] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:12:44,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:12:44,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-11-29 04:12:44,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142237940] [2023-11-29 04:12:44,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:12:44,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 04:12:44,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:44,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 04:12:44,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2023-11-29 04:12:44,342 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:44,700 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2023-11-29 04:12:44,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:12:44,700 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-29 04:12:44,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:44,701 INFO L225 Difference]: With dead ends: 17 [2023-11-29 04:12:44,701 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 04:12:44,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=61, Invalid=152, Unknown=1, NotChecked=26, Total=240 [2023-11-29 04:12:44,702 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:44,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:12:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 04:12:44,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 04:12:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 04:12:44,703 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2023-11-29 04:12:44,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:44,703 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:12:44,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:44,704 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 04:12:44,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 04:12:44,706 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:12:44,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 04:12:44,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:12:44,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 04:12:45,048 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 04:12:45,049 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2023-11-29 04:12:45,049 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2023-11-29 04:12:45,049 INFO L899 garLoopResultBuilder]: For program point L21-3(line 21) no Hoare annotation was computed. [2023-11-29 04:12:45,049 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 04:12:45,049 INFO L895 garLoopResultBuilder]: At program point L67-2(lines 67 122) the Hoare annotation is: (and (= (_ bv4 8) |ULTIMATE.start_main_~var_51~0#1|) (= (_ bv1 8) |ULTIMATE.start_main_~mask_SORT_1~0#1|) (= |ULTIMATE.start_main_~var_14~0#1| (_ bv0 8)) (let ((.cse0 ((_ zero_extend 24) |ULTIMATE.start_main_~state_8~0#1|))) (or (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse0 (_ bv2 32))))))) (_ bv0 32))))))) (_ bv1 32)))) (_ bv1 32))) (_ bv0 8)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv3 32))))))) (= |ULTIMATE.start_main_~var_7~0#1| (_ bv0 8)) (= (_ bv3 8) |ULTIMATE.start_main_~mask_SORT_12~0#1|) (exists ((|ULTIMATE.start_main_~var_53_arg_1~0#1| (_ BitVec 8))) (= |ULTIMATE.start_main_~state_8~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_53_arg_1~0#1|))) (_ bv7 32))))) (= (_ bv1 8) |ULTIMATE.start_main_~var_19~0#1|) (= (_ bv1 8) |ULTIMATE.start_main_~var_49~0#1|) (= (_ bv7 8) |ULTIMATE.start_main_~mask_SORT_6~0#1|)) [2023-11-29 04:12:45,049 INFO L899 garLoopResultBuilder]: For program point L67-3(lines 67 122) no Hoare annotation was computed. [2023-11-29 04:12:45,050 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2023-11-29 04:12:45,052 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-11-29 04:12:45,054 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:12:45,064 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_53_arg_1~0#1 : bv8 :: ~state_8~0 == ~bvand~32(~zero_extend~32~16(~zero_extend~32~16(ULTIMATE.start_main_~var_53_arg_1~0#1)[7:0]), 7bv32)[7:0]) could not be translated [2023-11-29 04:12:45,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:12:45 BoogieIcfgContainer [2023-11-29 04:12:45,066 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:12:45,067 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:12:45,067 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:12:45,067 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:12:45,067 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:12:31" (3/4) ... [2023-11-29 04:12:45,069 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 04:12:45,076 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-11-29 04:12:45,077 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-29 04:12:45,077 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 04:12:45,077 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 04:12:45,201 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:12:45,202 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 04:12:45,202 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:12:45,203 INFO L158 Benchmark]: Toolchain (without parser) took 14020.56ms. Allocated memory was 73.4MB in the beginning and 220.2MB in the end (delta: 146.8MB). Free memory was 45.6MB in the beginning and 191.5MB in the end (delta: -146.0MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2023-11-29 04:12:45,203 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 73.4MB. Free memory was 49.7MB in the beginning and 49.6MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:12:45,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.67ms. Allocated memory is still 73.4MB. Free memory was 45.4MB in the beginning and 32.7MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 04:12:45,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.13ms. Allocated memory is still 73.4MB. Free memory was 32.5MB in the beginning and 30.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:12:45,204 INFO L158 Benchmark]: Boogie Preprocessor took 63.79ms. Allocated memory is still 73.4MB. Free memory was 30.7MB in the beginning and 51.7MB in the end (delta: -21.0MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2023-11-29 04:12:45,204 INFO L158 Benchmark]: RCFGBuilder took 336.62ms. Allocated memory is still 73.4MB. Free memory was 51.7MB in the beginning and 36.8MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 04:12:45,205 INFO L158 Benchmark]: TraceAbstraction took 13184.50ms. Allocated memory was 73.4MB in the beginning and 220.2MB in the end (delta: 146.8MB). Free memory was 36.2MB in the beginning and 190.5MB in the end (delta: -154.2MB). Peak memory consumption was 118.2MB. Max. memory is 16.1GB. [2023-11-29 04:12:45,205 INFO L158 Benchmark]: Witness Printer took 135.53ms. Allocated memory is still 220.2MB. Free memory was 190.5MB in the beginning and 191.5MB in the end (delta: -1.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:12:45,207 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.17ms. Allocated memory is still 73.4MB. Free memory was 49.7MB in the beginning and 49.6MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.67ms. Allocated memory is still 73.4MB. Free memory was 45.4MB in the beginning and 32.7MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.13ms. Allocated memory is still 73.4MB. Free memory was 32.5MB in the beginning and 30.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.79ms. Allocated memory is still 73.4MB. Free memory was 30.7MB in the beginning and 51.7MB in the end (delta: -21.0MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * RCFGBuilder took 336.62ms. Allocated memory is still 73.4MB. Free memory was 51.7MB in the beginning and 36.8MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13184.50ms. Allocated memory was 73.4MB in the beginning and 220.2MB in the end (delta: 146.8MB). Free memory was 36.2MB in the beginning and 190.5MB in the end (delta: -154.2MB). Peak memory consumption was 118.2MB. Max. memory is 16.1GB. * Witness Printer took 135.53ms. Allocated memory is still 220.2MB. Free memory was 190.5MB in the beginning and 191.5MB in the end (delta: -1.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_53_arg_1~0#1 : bv8 :: ~state_8~0 == ~bvand~32(~zero_extend~32~16(~zero_extend~32~16(ULTIMATE.start_main_~var_53_arg_1~0#1)[7:0]), 7bv32)[7:0]) could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.1s, OverallIterations: 4, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 6 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=3, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 6 NumberOfFragments, 71 HoareAnnotationTreeSize, 1 FomulaSimplifications, 165 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 316 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 40 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 69 ConstructedInterpolants, 32 QuantifiedInterpolants, 18499 SizeOfPredicates, 163 NumberOfNonLiveVariables, 402 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 21/86 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: (((((((((4 == var_51) && (1 == mask_SORT_1)) && (var_14 == 0)) && (((((((~((((~(((state_8 >> 2) & 127)) & 127) | 0) & 127)) & 127) & 1) & 127) & 1) & 127) == 0) || (0 == (((state_8 & 127) & 3) & 127)))) && (var_7 == 0)) && (3 == mask_SORT_12)) && (1 == var_19)) && (1 == var_49)) && (7 == mask_SORT_6)) RESULT: Ultimate proved your program to be correct! [2023-11-29 04:12:45,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb9737f-2b7d-494c-a3eb-ae61b5554717/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE