./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU --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 a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:17:02,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:17:02,185 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-31 22:17:02,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:17:02,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:17:02,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:17:02,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:17:02,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:17:02,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:17:02,243 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:17:02,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:17:02,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:17:02,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:17:02,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:17:02,245 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:17:02,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:17:02,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:17:02,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:17:02,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:17:02,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:17:02,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:17:02,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:17:02,250 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:17:02,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:17:02,251 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:17:02,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:17:02,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:17:02,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:17:02,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:17:02,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:02,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:17:02,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:17:02,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:17:02,255 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:17:02,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:17:02,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:17:02,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:17:02,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:17:02,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:17:02,257 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_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/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_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU 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 -> a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b [2024-10-31 22:17:02,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:17:02,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:17:02,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:17:02,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:17:02,561 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:17:02,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c Unable to find full path for "g++" [2024-10-31 22:17:04,804 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:17:05,086 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:17:05,086 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2024-10-31 22:17:05,097 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/data/09552783b/2c58d1e29d8d42b9bd576a37e5d04c14/FLAGb036baf16 [2024-10-31 22:17:05,384 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/data/09552783b/2c58d1e29d8d42b9bd576a37e5d04c14 [2024-10-31 22:17:05,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:17:05,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:17:05,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:05,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:17:05,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:17:05,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:05" (1/1) ... [2024-10-31 22:17:05,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11bdfb29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:05, skipping insertion in model container [2024-10-31 22:17:05,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:05" (1/1) ... [2024-10-31 22:17:05,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:17:05,644 WARN L251 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_f63baaa6-160d-463f-9008-a19d1784ce0e/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2024-10-31 22:17:05,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:05,771 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:17:05,784 WARN L251 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_f63baaa6-160d-463f-9008-a19d1784ce0e/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2024-10-31 22:17:05,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:05,882 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:17:05,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:05 WrapperNode [2024-10-31 22:17:05,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:05,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:05,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:17:05,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:17:05,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:05" (1/1) ... [2024-10-31 22:17:05,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:05" (1/1) ... [2024-10-31 22:17:05,985 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 643 [2024-10-31 22:17:05,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:05,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:17:05,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:17:05,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:17:06,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:05" (1/1) ... [2024-10-31 22:17:06,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:05" (1/1) ... [2024-10-31 22:17:06,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:05" (1/1) ... [2024-10-31 22:17:06,043 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-31 22:17:06,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:05" (1/1) ... [2024-10-31 22:17:06,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:05" (1/1) ... [2024-10-31 22:17:06,063 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:05" (1/1) ... [2024-10-31 22:17:06,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:05" (1/1) ... [2024-10-31 22:17:06,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:05" (1/1) ... [2024-10-31 22:17:06,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:05" (1/1) ... [2024-10-31 22:17:06,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:17:06,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:17:06,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:17:06,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:17:06,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:05" (1/1) ... [2024-10-31 22:17:06,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:06,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:17:06,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:17:06,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:17:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:17:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:17:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:17:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:17:06,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:17:06,415 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:17:06,418 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:17:07,509 INFO L? ?]: Removed 297 outVars from TransFormulas that were not future-live. [2024-10-31 22:17:07,510 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:17:07,527 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:17:07,528 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:17:07,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:07 BoogieIcfgContainer [2024-10-31 22:17:07,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:17:07,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:17:07,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:17:07,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:17:07,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:17:05" (1/3) ... [2024-10-31 22:17:07,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606fad5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:07, skipping insertion in model container [2024-10-31 22:17:07,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:05" (2/3) ... [2024-10-31 22:17:07,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606fad5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:07, skipping insertion in model container [2024-10-31 22:17:07,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:07" (3/3) ... [2024-10-31 22:17:07,539 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul4.c [2024-10-31 22:17:07,559 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:17:07,560 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:17:07,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:17:07,648 INFO L333 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, 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;@36e1457e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:17:07,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:17:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 182 states, 180 states have (on average 1.4944444444444445) internal successors, (269), 181 states have internal predecessors, (269), 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) [2024-10-31 22:17:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-31 22:17:07,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:07,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:07,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:07,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:07,676 INFO L85 PathProgramCache]: Analyzing trace with hash -461519839, now seen corresponding path program 1 times [2024-10-31 22:17:07,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:07,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419651258] [2024-10-31 22:17:07,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:07,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:17:08,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:08,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419651258] [2024-10-31 22:17:08,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419651258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:08,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:08,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:08,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930661936] [2024-10-31 22:17:08,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:08,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:08,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:08,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:08,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:08,787 INFO L87 Difference]: Start difference. First operand has 182 states, 180 states have (on average 1.4944444444444445) internal successors, (269), 181 states have internal predecessors, (269), 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 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-10-31 22:17:08,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:08,874 INFO L93 Difference]: Finished difference Result 297 states and 441 transitions. [2024-10-31 22:17:08,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:08,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2024-10-31 22:17:08,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:08,898 INFO L225 Difference]: With dead ends: 297 [2024-10-31 22:17:08,898 INFO L226 Difference]: Without dead ends: 181 [2024-10-31 22:17:08,903 INFO L431 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 [2024-10-31 22:17:08,913 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 783 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 [2024-10-31 22:17:08,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 783 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-31 22:17:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-31 22:17:09,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 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) [2024-10-31 22:17:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 267 transitions. [2024-10-31 22:17:09,035 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 267 transitions. Word has length 65 [2024-10-31 22:17:09,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:09,036 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 267 transitions. [2024-10-31 22:17:09,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-10-31 22:17:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 267 transitions. [2024-10-31 22:17:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-31 22:17:09,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:09,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:09,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:17:09,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:09,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:09,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1420517578, now seen corresponding path program 1 times [2024-10-31 22:17:09,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:09,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455861291] [2024-10-31 22:17:09,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:09,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:17:09,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:09,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455861291] [2024-10-31 22:17:09,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455861291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:09,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:09,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:09,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678869738] [2024-10-31 22:17:09,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:09,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:09,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:09,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:09,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:09,387 INFO L87 Difference]: Start difference. First operand 181 states and 267 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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) [2024-10-31 22:17:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:09,443 INFO L93 Difference]: Finished difference Result 298 states and 439 transitions. [2024-10-31 22:17:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:09,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2024-10-31 22:17:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:09,445 INFO L225 Difference]: With dead ends: 298 [2024-10-31 22:17:09,445 INFO L226 Difference]: Without dead ends: 183 [2024-10-31 22:17:09,446 INFO L431 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 [2024-10-31 22:17:09,447 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 779 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 [2024-10-31 22:17:09,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 779 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-31 22:17:09,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-10-31 22:17:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.478021978021978) internal successors, (269), 182 states have internal predecessors, (269), 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) [2024-10-31 22:17:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 269 transitions. [2024-10-31 22:17:09,483 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 269 transitions. Word has length 66 [2024-10-31 22:17:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:09,483 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 269 transitions. [2024-10-31 22:17:09,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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) [2024-10-31 22:17:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 269 transitions. [2024-10-31 22:17:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-31 22:17:09,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:09,486 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:09,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:17:09,486 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:09,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:09,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2110629786, now seen corresponding path program 1 times [2024-10-31 22:17:09,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:09,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218720376] [2024-10-31 22:17:09,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:09,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:10,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:17:10,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:10,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218720376] [2024-10-31 22:17:10,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218720376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:10,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:10,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:17:10,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391540191] [2024-10-31 22:17:10,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:10,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:17:10,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:10,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:17:10,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:17:10,032 INFO L87 Difference]: Start difference. First operand 183 states and 269 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2024-10-31 22:17:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:10,099 INFO L93 Difference]: Finished difference Result 304 states and 446 transitions. [2024-10-31 22:17:10,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:17:10,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2024-10-31 22:17:10,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:10,102 INFO L225 Difference]: With dead ends: 304 [2024-10-31 22:17:10,102 INFO L226 Difference]: Without dead ends: 187 [2024-10-31 22:17:10,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:17:10,104 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 212 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:10,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 775 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:10,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-31 22:17:10,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2024-10-31 22:17:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.4702702702702704) internal successors, (272), 185 states have internal predecessors, (272), 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) [2024-10-31 22:17:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 272 transitions. [2024-10-31 22:17:10,115 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 272 transitions. Word has length 67 [2024-10-31 22:17:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:10,116 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 272 transitions. [2024-10-31 22:17:10,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2024-10-31 22:17:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 272 transitions. [2024-10-31 22:17:10,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-31 22:17:10,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:10,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:10,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:17:10,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:10,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:10,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1725407879, now seen corresponding path program 1 times [2024-10-31 22:17:10,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:10,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068718753] [2024-10-31 22:17:10,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:10,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:17:11,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:11,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068718753] [2024-10-31 22:17:11,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068718753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:11,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:11,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:17:11,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87404657] [2024-10-31 22:17:11,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:11,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:17:11,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:11,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:17:11,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:17:11,329 INFO L87 Difference]: Start difference. First operand 186 states and 272 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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) [2024-10-31 22:17:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:11,454 INFO L93 Difference]: Finished difference Result 329 states and 479 transitions. [2024-10-31 22:17:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:17:11,455 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 68 [2024-10-31 22:17:11,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:11,458 INFO L225 Difference]: With dead ends: 329 [2024-10-31 22:17:11,458 INFO L226 Difference]: Without dead ends: 209 [2024-10-31 22:17:11,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:17:11,460 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 24 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:11,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1530 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:17:11,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-31 22:17:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 194. [2024-10-31 22:17:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 193 states have internal predecessors, (283), 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) [2024-10-31 22:17:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2024-10-31 22:17:11,470 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 68 [2024-10-31 22:17:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:11,471 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2024-10-31 22:17:11,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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) [2024-10-31 22:17:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2024-10-31 22:17:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-31 22:17:11,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:11,473 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:11,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:17:11,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:11,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:11,484 INFO L85 PathProgramCache]: Analyzing trace with hash -158687039, now seen corresponding path program 1 times [2024-10-31 22:17:11,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:11,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820439770] [2024-10-31 22:17:11,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:11,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:17:12,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:12,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820439770] [2024-10-31 22:17:12,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820439770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:12,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:12,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:17:12,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407573258] [2024-10-31 22:17:12,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:12,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:17:12,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:12,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:17:12,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:17:12,368 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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) [2024-10-31 22:17:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:12,488 INFO L93 Difference]: Finished difference Result 340 states and 494 transitions. [2024-10-31 22:17:12,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:17:12,489 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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 69 [2024-10-31 22:17:12,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:12,490 INFO L225 Difference]: With dead ends: 340 [2024-10-31 22:17:12,491 INFO L226 Difference]: Without dead ends: 212 [2024-10-31 22:17:12,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:17:12,492 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 21 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:12,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1521 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:17:12,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-31 22:17:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 200. [2024-10-31 22:17:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.4623115577889447) internal successors, (291), 199 states have internal predecessors, (291), 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) [2024-10-31 22:17:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 291 transitions. [2024-10-31 22:17:12,502 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 291 transitions. Word has length 69 [2024-10-31 22:17:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:12,502 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 291 transitions. [2024-10-31 22:17:12,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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) [2024-10-31 22:17:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 291 transitions. [2024-10-31 22:17:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-31 22:17:12,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:12,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:12,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:17:12,505 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:12,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:12,506 INFO L85 PathProgramCache]: Analyzing trace with hash -814345339, now seen corresponding path program 1 times [2024-10-31 22:17:12,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:12,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206960060] [2024-10-31 22:17:12,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:12,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:17:13,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:13,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206960060] [2024-10-31 22:17:13,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206960060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:13,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:13,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:17:13,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176353271] [2024-10-31 22:17:13,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:13,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:17:13,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:13,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:17:13,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:17:13,199 INFO L87 Difference]: Start difference. First operand 200 states and 291 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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) [2024-10-31 22:17:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:13,348 INFO L93 Difference]: Finished difference Result 332 states and 482 transitions. [2024-10-31 22:17:13,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:17:13,349 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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 69 [2024-10-31 22:17:13,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:13,350 INFO L225 Difference]: With dead ends: 332 [2024-10-31 22:17:13,350 INFO L226 Difference]: Without dead ends: 198 [2024-10-31 22:17:13,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:17:13,352 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 214 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:13,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1703 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:17:13,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-31 22:17:13,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2024-10-31 22:17:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.4639175257731958) internal successors, (284), 194 states have internal predecessors, (284), 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) [2024-10-31 22:17:13,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 284 transitions. [2024-10-31 22:17:13,360 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 284 transitions. Word has length 69 [2024-10-31 22:17:13,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:13,360 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 284 transitions. [2024-10-31 22:17:13,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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) [2024-10-31 22:17:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 284 transitions. [2024-10-31 22:17:13,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-31 22:17:13,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:13,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:13,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:17:13,363 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:13,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:13,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1464837146, now seen corresponding path program 1 times [2024-10-31 22:17:13,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:13,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017021196] [2024-10-31 22:17:13,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:13,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:17:13,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:13,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017021196] [2024-10-31 22:17:13,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017021196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:13,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:13,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:17:13,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430630051] [2024-10-31 22:17:13,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:13,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:17:13,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:13,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:17:13,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:17:13,765 INFO L87 Difference]: Start difference. First operand 195 states and 284 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2024-10-31 22:17:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:13,836 INFO L93 Difference]: Finished difference Result 443 states and 641 transitions. [2024-10-31 22:17:13,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:17:13,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 69 [2024-10-31 22:17:13,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:13,838 INFO L225 Difference]: With dead ends: 443 [2024-10-31 22:17:13,839 INFO L226 Difference]: Without dead ends: 314 [2024-10-31 22:17:13,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:17:13,841 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 364 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:13,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 759 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:13,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-10-31 22:17:13,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 231. [2024-10-31 22:17:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.4608695652173913) internal successors, (336), 230 states have internal predecessors, (336), 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) [2024-10-31 22:17:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 336 transitions. [2024-10-31 22:17:13,858 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 336 transitions. Word has length 69 [2024-10-31 22:17:13,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:13,860 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 336 transitions. [2024-10-31 22:17:13,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2024-10-31 22:17:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 336 transitions. [2024-10-31 22:17:13,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-31 22:17:13,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:13,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:13,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:17:13,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:13,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:13,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1696516813, now seen corresponding path program 1 times [2024-10-31 22:17:13,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:13,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886374560] [2024-10-31 22:17:13,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:13,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:14,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:17:14,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:14,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886374560] [2024-10-31 22:17:14,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886374560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:14,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:14,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:17:14,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18059501] [2024-10-31 22:17:14,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:14,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:17:14,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:14,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:17:14,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:17:14,242 INFO L87 Difference]: Start difference. First operand 231 states and 336 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2024-10-31 22:17:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:14,468 INFO L93 Difference]: Finished difference Result 401 states and 575 transitions. [2024-10-31 22:17:14,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:17:14,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 69 [2024-10-31 22:17:14,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:14,470 INFO L225 Difference]: With dead ends: 401 [2024-10-31 22:17:14,471 INFO L226 Difference]: Without dead ends: 268 [2024-10-31 22:17:14,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:17:14,473 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 296 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:14,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 955 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:17:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-31 22:17:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 229. [2024-10-31 22:17:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.4517543859649122) internal successors, (331), 228 states have internal predecessors, (331), 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) [2024-10-31 22:17:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 331 transitions. [2024-10-31 22:17:14,483 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 331 transitions. Word has length 69 [2024-10-31 22:17:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:14,484 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 331 transitions. [2024-10-31 22:17:14,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2024-10-31 22:17:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 331 transitions. [2024-10-31 22:17:14,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-31 22:17:14,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:14,486 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:14,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:17:14,487 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:14,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:14,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1079174156, now seen corresponding path program 1 times [2024-10-31 22:17:14,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:14,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138844036] [2024-10-31 22:17:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:14,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:17:14,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:14,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138844036] [2024-10-31 22:17:14,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138844036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:14,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:14,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:17:14,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297882115] [2024-10-31 22:17:14,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:14,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:17:14,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:14,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:17:14,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:17:14,935 INFO L87 Difference]: Start difference. First operand 229 states and 331 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2024-10-31 22:17:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:14,996 INFO L93 Difference]: Finished difference Result 433 states and 620 transitions. [2024-10-31 22:17:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:17:14,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 69 [2024-10-31 22:17:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:14,998 INFO L225 Difference]: With dead ends: 433 [2024-10-31 22:17:14,998 INFO L226 Difference]: Without dead ends: 298 [2024-10-31 22:17:14,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:17:15,000 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 454 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:15,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 764 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:15,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-31 22:17:15,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 227. [2024-10-31 22:17:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4424778761061947) internal successors, (326), 226 states have internal predecessors, (326), 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) [2024-10-31 22:17:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 326 transitions. [2024-10-31 22:17:15,007 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 326 transitions. Word has length 69 [2024-10-31 22:17:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:15,008 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 326 transitions. [2024-10-31 22:17:15,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2024-10-31 22:17:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 326 transitions. [2024-10-31 22:17:15,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-31 22:17:15,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:15,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:15,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:17:15,010 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:15,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:15,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1343504549, now seen corresponding path program 1 times [2024-10-31 22:17:15,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:15,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590049165] [2024-10-31 22:17:15,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:15,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:17:15,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:15,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590049165] [2024-10-31 22:17:15,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590049165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:15,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:15,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:17:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46800330] [2024-10-31 22:17:15,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:15,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:17:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:15,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:17:15,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:17:15,401 INFO L87 Difference]: Start difference. First operand 227 states and 326 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2024-10-31 22:17:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:15,459 INFO L93 Difference]: Finished difference Result 356 states and 512 transitions. [2024-10-31 22:17:15,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:17:15,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 69 [2024-10-31 22:17:15,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:15,463 INFO L225 Difference]: With dead ends: 356 [2024-10-31 22:17:15,463 INFO L226 Difference]: Without dead ends: 219 [2024-10-31 22:17:15,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:17:15,464 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 247 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:15,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 763 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-31 22:17:15,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-31 22:17:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.4495412844036697) internal successors, (316), 218 states have internal predecessors, (316), 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) [2024-10-31 22:17:15,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 316 transitions. [2024-10-31 22:17:15,473 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 316 transitions. Word has length 69 [2024-10-31 22:17:15,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:15,473 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 316 transitions. [2024-10-31 22:17:15,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2024-10-31 22:17:15,474 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 316 transitions. [2024-10-31 22:17:15,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-31 22:17:15,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:15,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:15,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:17:15,475 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:15,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:15,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2025898208, now seen corresponding path program 1 times [2024-10-31 22:17:15,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:15,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094350477] [2024-10-31 22:17:15,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:15,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:17:15,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:15,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094350477] [2024-10-31 22:17:15,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094350477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:15,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:15,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:17:15,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340144275] [2024-10-31 22:17:15,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:15,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:17:15,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:15,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:17:15,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:17:15,864 INFO L87 Difference]: Start difference. First operand 219 states and 316 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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) [2024-10-31 22:17:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:15,929 INFO L93 Difference]: Finished difference Result 387 states and 553 transitions. [2024-10-31 22:17:15,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:17:15,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 70 [2024-10-31 22:17:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:15,932 INFO L225 Difference]: With dead ends: 387 [2024-10-31 22:17:15,932 INFO L226 Difference]: Without dead ends: 258 [2024-10-31 22:17:15,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:17:15,933 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 334 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:15,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 760 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:15,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-31 22:17:15,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 227. [2024-10-31 22:17:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4380530973451326) internal successors, (325), 226 states have internal predecessors, (325), 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) [2024-10-31 22:17:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 325 transitions. [2024-10-31 22:17:15,943 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 325 transitions. Word has length 70 [2024-10-31 22:17:15,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:15,945 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 325 transitions. [2024-10-31 22:17:15,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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) [2024-10-31 22:17:15,946 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 325 transitions. [2024-10-31 22:17:15,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-31 22:17:15,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:15,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:15,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:17:15,947 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:15,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:15,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2089643758, now seen corresponding path program 1 times [2024-10-31 22:17:15,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:15,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989427147] [2024-10-31 22:17:15,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:15,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:17:16,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:17:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:17:16,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:17:16,094 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:17:16,096 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:17:16,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:17:16,101 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:16,196 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:17:16,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:17:16 BoogieIcfgContainer [2024-10-31 22:17:16,202 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:17:16,202 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:17:16,203 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:17:16,203 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:17:16,204 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:07" (3/4) ... [2024-10-31 22:17:16,207 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:17:16,208 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:17:16,209 INFO L158 Benchmark]: Toolchain (without parser) took 10820.13ms. Allocated memory was 125.8MB in the beginning and 314.6MB in the end (delta: 188.7MB). Free memory was 94.8MB in the beginning and 231.9MB in the end (delta: -137.1MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2024-10-31 22:17:16,209 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 125.8MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:17:16,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.14ms. Allocated memory is still 125.8MB. Free memory was 94.6MB in the beginning and 75.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-31 22:17:16,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.85ms. Allocated memory is still 125.8MB. Free memory was 75.7MB in the beginning and 65.8MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-31 22:17:16,210 INFO L158 Benchmark]: Boogie Preprocessor took 138.35ms. Allocated memory is still 125.8MB. Free memory was 65.6MB in the beginning and 59.6MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:17:16,211 INFO L158 Benchmark]: RCFGBuilder took 1402.63ms. Allocated memory was 125.8MB in the beginning and 161.5MB in the end (delta: 35.7MB). Free memory was 59.6MB in the beginning and 105.2MB in the end (delta: -45.7MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-10-31 22:17:16,211 INFO L158 Benchmark]: TraceAbstraction took 8670.92ms. Allocated memory was 161.5MB in the beginning and 314.6MB in the end (delta: 153.1MB). Free memory was 104.0MB in the beginning and 232.9MB in the end (delta: -128.9MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2024-10-31 22:17:16,211 INFO L158 Benchmark]: Witness Printer took 5.74ms. Allocated memory is still 314.6MB. Free memory was 232.9MB in the beginning and 231.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:17:16,213 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.29ms. Allocated memory is still 125.8MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.14ms. Allocated memory is still 125.8MB. Free memory was 94.6MB in the beginning and 75.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.85ms. Allocated memory is still 125.8MB. Free memory was 75.7MB in the beginning and 65.8MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 138.35ms. Allocated memory is still 125.8MB. Free memory was 65.6MB in the beginning and 59.6MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1402.63ms. Allocated memory was 125.8MB in the beginning and 161.5MB in the end (delta: 35.7MB). Free memory was 59.6MB in the beginning and 105.2MB in the end (delta: -45.7MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8670.92ms. Allocated memory was 161.5MB in the beginning and 314.6MB in the end (delta: 153.1MB). Free memory was 104.0MB in the beginning and 232.9MB in the end (delta: -128.9MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Witness Printer took 5.74ms. Allocated memory is still 314.6MB. Free memory was 232.9MB in the beginning and 231.9MB 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.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 bitwiseAnd at line 168. 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 - 32); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 64); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (64 - 1); [L35] const SORT_64 mask_SORT_64 = (SORT_64)-1 >> (sizeof(SORT_64) * 8 - 4); [L36] const SORT_64 msb_SORT_64 = (SORT_64)1 << (4 - 1); [L38] const SORT_66 mask_SORT_66 = (SORT_66)-1 >> (sizeof(SORT_66) * 8 - 60); [L39] const SORT_66 msb_SORT_66 = (SORT_66)1 << (60 - 1); [L41] const SORT_10 var_11 = 0; [L42] const SORT_1 var_14 = 0; [L43] const SORT_3 var_24 = 0; [L44] const SORT_1 var_51 = 1; [L45] const SORT_64 var_65 = 0; [L47] SORT_1 input_2; [L48] SORT_3 input_4; [L49] SORT_3 input_5; [L50] SORT_1 input_6; [L51] SORT_1 input_7; [L52] SORT_1 input_8; [L53] SORT_1 input_9; [L55] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L55] SORT_10 state_12 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L56] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L57] SORT_10 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L58] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L59] SORT_3 state_25 = __VERIFIER_nondet_uint() & mask_SORT_3; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L60] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L61] SORT_3 state_30 = __VERIFIER_nondet_uint() & mask_SORT_3; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L62] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L63] SORT_3 state_37 = __VERIFIER_nondet_uint() & mask_SORT_3; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L64] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L65] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L65] SORT_3 state_42 = __VERIFIER_nondet_uint() & mask_SORT_3; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L66] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L67] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L68] SORT_1 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L69] SORT_1 state_87 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L70] SORT_1 state_92 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] SORT_10 init_13_arg_1 = var_11; [L73] state_12 = init_13_arg_1 [L74] SORT_1 init_16_arg_1 = var_14; [L75] state_15 = init_16_arg_1 [L76] SORT_10 init_19_arg_1 = var_11; [L77] state_18 = init_19_arg_1 [L78] SORT_1 init_21_arg_1 = var_14; [L79] state_20 = init_21_arg_1 [L80] SORT_3 init_26_arg_1 = var_24; [L81] state_25 = init_26_arg_1 [L82] SORT_1 init_28_arg_1 = var_14; [L83] state_27 = init_28_arg_1 [L84] SORT_3 init_31_arg_1 = var_24; [L85] state_30 = init_31_arg_1 [L86] SORT_1 init_33_arg_1 = var_14; [L87] state_32 = init_33_arg_1 [L88] SORT_3 init_38_arg_1 = var_24; [L89] state_37 = init_38_arg_1 [L90] SORT_1 init_40_arg_1 = var_14; [L91] state_39 = init_40_arg_1 [L92] SORT_3 init_43_arg_1 = var_24; [L93] state_42 = init_43_arg_1 [L94] SORT_1 init_45_arg_1 = var_14; [L95] state_44 = init_45_arg_1 [L96] SORT_1 init_70_arg_1 = var_14; [L97] state_69 = init_70_arg_1 [L98] SORT_1 init_75_arg_1 = var_14; [L99] state_74 = init_75_arg_1 [L100] SORT_1 init_88_arg_1 = var_14; [L101] state_87 = init_88_arg_1 [L102] SORT_1 init_93_arg_1 = var_14; [L103] state_92 = init_93_arg_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L106] input_2 = __VERIFIER_nondet_uchar() [L107] input_4 = __VERIFIER_nondet_uint() [L108] input_5 = __VERIFIER_nondet_uint() [L109] input_6 = __VERIFIER_nondet_uchar() [L110] EXPR input_6 & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L110] input_6 = input_6 & mask_SORT_1 [L111] input_7 = __VERIFIER_nondet_uchar() [L112] EXPR input_7 & mask_SORT_1 VAL [input_6=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L112] input_7 = input_7 & mask_SORT_1 [L113] input_8 = __VERIFIER_nondet_uchar() [L114] EXPR input_8 & mask_SORT_1 VAL [input_6=0, input_7=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L114] input_8 = input_8 & mask_SORT_1 [L115] input_9 = __VERIFIER_nondet_uchar() [L116] EXPR input_9 & mask_SORT_1 VAL [input_6=0, input_7=0, input_8=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L116] input_9 = input_9 & mask_SORT_1 [L119] SORT_1 var_17_arg_0 = state_15; [L120] SORT_10 var_17_arg_1 = state_12; [L121] SORT_10 var_17_arg_2 = var_11; [L122] SORT_10 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_24=0, var_51=1, var_65=0] [L123] EXPR var_17 & mask_SORT_10 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L123] var_17 = var_17 & mask_SORT_10 [L124] SORT_1 var_22_arg_0 = state_20; [L125] SORT_10 var_22_arg_1 = state_18; [L126] SORT_10 var_22_arg_2 = var_11; [L127] SORT_10 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_22=0, var_24=0, var_51=1, var_65=0] [L128] EXPR var_22 & mask_SORT_10 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_24=0, var_51=1, var_65=0] [L128] var_22 = var_22 & mask_SORT_10 [L129] SORT_10 var_23_arg_0 = var_17; [L130] SORT_10 var_23_arg_1 = var_22; [L131] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L132] SORT_1 var_29_arg_0 = state_27; [L133] SORT_3 var_29_arg_1 = state_25; [L134] SORT_3 var_29_arg_2 = var_24; [L135] SORT_3 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_51=1, var_65=0] [L136] EXPR var_29 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_51=1, var_65=0] [L136] var_29 = var_29 & mask_SORT_3 [L137] SORT_1 var_34_arg_0 = state_32; [L138] SORT_3 var_34_arg_1 = state_30; [L139] SORT_3 var_34_arg_2 = var_24; [L140] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_34=0, var_51=1, var_65=0] [L141] EXPR var_34 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_51=1, var_65=0] [L141] var_34 = var_34 & mask_SORT_3 [L142] SORT_3 var_35_arg_0 = var_29; [L143] SORT_3 var_35_arg_1 = var_34; [L144] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L145] SORT_1 var_36_arg_0 = var_23; [L146] SORT_1 var_36_arg_1 = var_35; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36_arg_0=1, var_36_arg_1=1, var_51=1, var_65=0] [L147] EXPR var_36_arg_0 & var_36_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L147] SORT_1 var_36 = var_36_arg_0 & var_36_arg_1; [L148] SORT_1 var_41_arg_0 = state_39; [L149] SORT_3 var_41_arg_1 = state_37; [L150] SORT_3 var_41_arg_2 = var_24; [L151] SORT_3 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_51=1, var_65=0] [L152] EXPR var_41 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_51=1, var_65=0] [L152] var_41 = var_41 & mask_SORT_3 [L153] SORT_1 var_46_arg_0 = state_44; [L154] SORT_3 var_46_arg_1 = state_42; [L155] SORT_3 var_46_arg_2 = var_24; [L156] SORT_3 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_46=0, var_51=1, var_65=0] [L157] EXPR var_46 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_51=1, var_65=0] [L157] var_46 = var_46 & mask_SORT_3 [L158] SORT_3 var_47_arg_0 = var_41; [L159] SORT_3 var_47_arg_1 = var_46; [L160] SORT_1 var_47 = var_47_arg_0 == var_47_arg_1; [L161] SORT_1 var_48_arg_0 = var_36; [L162] SORT_1 var_48_arg_1 = var_47; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_48_arg_0=1, var_48_arg_1=1, var_51=1, var_65=0] [L163] EXPR var_48_arg_0 & var_48_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L163] SORT_1 var_48 = var_48_arg_0 & var_48_arg_1; [L164] SORT_1 var_52_arg_0 = var_48; [L165] SORT_1 var_52 = ~var_52_arg_0; [L166] SORT_1 var_53_arg_0 = var_51; [L167] SORT_1 var_53_arg_1 = var_52; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_53_arg_0=1, var_53_arg_1=-2, var_65=0] [L168] EXPR var_53_arg_0 & var_53_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L168] SORT_1 var_53 = var_53_arg_0 & var_53_arg_1; [L169] EXPR var_53 & mask_SORT_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L169] var_53 = var_53 & mask_SORT_1 [L170] SORT_1 bad_54_arg_0 = var_53; [L171] CALL __VERIFIER_assert(!(bad_54_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 182 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2166 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2166 mSDsluCounter, 11092 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8265 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 540 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 2827 mSDtfsCounter, 540 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=231occurred in iteration=7, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 255 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 820 NumberOfCodeBlocks, 820 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 739 ConstructedInterpolants, 0 QuantifiedInterpolants, 1982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 [2024-10-31 22:17:16,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU --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 a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:17:19,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:17:19,304 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-31 22:17:19,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:17:19,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:17:19,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:17:19,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:17:19,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:17:19,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:17:19,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:17:19,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:17:19,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:17:19,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:17:19,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:17:19,375 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:17:19,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:17:19,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:17:19,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:17:19,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:17:19,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:17:19,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:17:19,385 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:17:19,385 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:17:19,385 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:17:19,386 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:17:19,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:17:19,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:17:19,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:17:19,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:17:19,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:17:19,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:17:19,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:19,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:17:19,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:17:19,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:17:19,392 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:17:19,392 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:17:19,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:17:19,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:17:19,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:17:19,394 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:17:19,395 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:17:19,395 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_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/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_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU 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 -> a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b [2024-10-31 22:17:19,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:17:19,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:17:19,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:17:19,864 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:17:19,864 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:17:19,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c Unable to find full path for "g++" [2024-10-31 22:17:22,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:17:22,310 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:17:22,312 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2024-10-31 22:17:22,323 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/data/dac3ea194/bb173c4864de4ecdbf22b019a186b0b8/FLAG50f4bb71f [2024-10-31 22:17:22,339 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/data/dac3ea194/bb173c4864de4ecdbf22b019a186b0b8 [2024-10-31 22:17:22,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:17:22,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:17:22,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:22,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:17:22,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:17:22,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:22" (1/1) ... [2024-10-31 22:17:22,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e7552ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:22, skipping insertion in model container [2024-10-31 22:17:22,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:22" (1/1) ... [2024-10-31 22:17:22,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:17:22,661 WARN L251 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_f63baaa6-160d-463f-9008-a19d1784ce0e/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2024-10-31 22:17:22,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:22,820 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:17:22,835 WARN L251 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_f63baaa6-160d-463f-9008-a19d1784ce0e/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2024-10-31 22:17:22,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:22,995 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:17:22,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:22 WrapperNode [2024-10-31 22:17:22,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:22,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:22,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:17:23,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:17:23,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:22" (1/1) ... [2024-10-31 22:17:23,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:22" (1/1) ... [2024-10-31 22:17:23,069 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 299 [2024-10-31 22:17:23,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:23,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:17:23,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:17:23,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:17:23,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:22" (1/1) ... [2024-10-31 22:17:23,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:22" (1/1) ... [2024-10-31 22:17:23,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:22" (1/1) ... [2024-10-31 22:17:23,123 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-31 22:17:23,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:22" (1/1) ... [2024-10-31 22:17:23,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:22" (1/1) ... [2024-10-31 22:17:23,135 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:22" (1/1) ... [2024-10-31 22:17:23,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:22" (1/1) ... [2024-10-31 22:17:23,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:22" (1/1) ... [2024-10-31 22:17:23,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:22" (1/1) ... [2024-10-31 22:17:23,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:17:23,146 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:17:23,146 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:17:23,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:17:23,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:22" (1/1) ... [2024-10-31 22:17:23,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:23,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:17:23,182 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:17:23,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:17:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:17:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:17:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-31 22:17:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:17:23,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:17:23,399 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:17:23,402 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:17:23,928 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-10-31 22:17:23,929 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:17:23,941 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:17:23,942 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:17:23,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:23 BoogieIcfgContainer [2024-10-31 22:17:23,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:17:23,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:17:23,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:17:23,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:17:23,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:17:22" (1/3) ... [2024-10-31 22:17:23,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173fc7d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:23, skipping insertion in model container [2024-10-31 22:17:23,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:22" (2/3) ... [2024-10-31 22:17:23,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173fc7d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:23, skipping insertion in model container [2024-10-31 22:17:23,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:23" (3/3) ... [2024-10-31 22:17:23,955 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul4.c [2024-10-31 22:17:23,975 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:17:23,975 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:17:24,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:17:24,073 INFO L333 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, 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;@4820867d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:17:24,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:17:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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) [2024-10-31 22:17:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-31 22:17:24,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:24,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-31 22:17:24,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:24,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:24,096 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-10-31 22:17:24,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:17:24,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504865573] [2024-10-31 22:17:24,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:24,114 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 [2024-10-31 22:17:24,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:17:24,118 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/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) [2024-10-31 22:17:24,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:17:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:24,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-31 22:17:24,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:17:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:17:25,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:17:25,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:17:25,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504865573] [2024-10-31 22:17:25,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504865573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:25,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:25,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:25,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713694008] [2024-10-31 22:17:25,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:25,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:25,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:17:25,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:25,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:25,204 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2024-10-31 22:17:25,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:25,411 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-10-31 22:17:25,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:25,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-10-31 22:17:25,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:25,423 INFO L225 Difference]: With dead ends: 17 [2024-10-31 22:17:25,423 INFO L226 Difference]: Without dead ends: 9 [2024-10-31 22:17:25,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:25,432 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:25,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:17:25,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-31 22:17:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-10-31 22:17:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:17:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-10-31 22:17:25,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-10-31 22:17:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:25,469 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-10-31 22:17:25,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2024-10-31 22:17:25,470 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-10-31 22:17:25,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-31 22:17:25,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:25,471 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-31 22:17:25,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/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)] Ended with exit code 0 [2024-10-31 22:17:25,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:17:25,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:25,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:25,675 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-10-31 22:17:25,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:17:25,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487688535] [2024-10-31 22:17:25,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:25,677 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 [2024-10-31 22:17:25,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:17:25,684 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/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) [2024-10-31 22:17:25,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f63baaa6-160d-463f-9008-a19d1784ce0e/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:17:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:26,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-10-31 22:17:26,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:17:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:17:28,340 INFO L311 TraceCheckSpWp]: Computing backward predicates...