./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB --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 827228a8fb731d7038bb1b8c7cce3c35edda9a5c3ee552084966688fbdc104d2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:13:34,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:13:34,121 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-27 20:13:34,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:13:34,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:13:34,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:13:34,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:13:34,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:13:34,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:13:34,190 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:13:34,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:13:34,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:13:34,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:13:34,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:13:34,192 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:13:34,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:13:34,193 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:13:34,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:13:34,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:13:34,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:13:34,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:13:34,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:13:34,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:13:34,194 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:13:34,195 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:13:34,195 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:13:34,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:13:34,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:13:34,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:13:34,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:13:34,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:13:34,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:13:34,197 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:13:34,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:13:34,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:13:34,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:13:34,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:13:34,197 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:13:34,198 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:13:34,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:13:34,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:13:34,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:13:34,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:13:34,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:13:34,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:13:34,199 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 827228a8fb731d7038bb1b8c7cce3c35edda9a5c3ee552084966688fbdc104d2 [2024-11-27 20:13:34,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:13:34,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:13:34,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:13:34,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:13:34,560 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:13:34,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c [2024-11-27 20:13:37,916 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/data/143689d27/00cfbe25880e480785a2dc9adae00ae5/FLAG35397c26d [2024-11-27 20:13:38,230 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:13:38,231 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c [2024-11-27 20:13:38,241 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/data/143689d27/00cfbe25880e480785a2dc9adae00ae5/FLAG35397c26d [2024-11-27 20:13:38,258 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/data/143689d27/00cfbe25880e480785a2dc9adae00ae5 [2024-11-27 20:13:38,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:13:38,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:13:38,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:13:38,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:13:38,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:13:38,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:13:38" (1/1) ... [2024-11-27 20:13:38,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8fe8ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:38, skipping insertion in model container [2024-11-27 20:13:38,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:13:38" (1/1) ... [2024-11-27 20:13:38,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:13:38,499 WARN L250 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_363dfd4e-2ff7-4986-afe4-869e0b8897ca/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c[1250,1263] [2024-11-27 20:13:38,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:13:38,640 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:13:38,652 WARN L250 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_363dfd4e-2ff7-4986-afe4-869e0b8897ca/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c[1250,1263] [2024-11-27 20:13:38,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:13:38,773 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:13:38,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:38 WrapperNode [2024-11-27 20:13:38,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:13:38,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:13:38,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:13:38,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:13:38,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:38" (1/1) ... [2024-11-27 20:13:38,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:38" (1/1) ... [2024-11-27 20:13:38,866 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 307 [2024-11-27 20:13:38,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:13:38,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:13:38,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:13:38,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:13:38,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:38" (1/1) ... [2024-11-27 20:13:38,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:38" (1/1) ... [2024-11-27 20:13:38,894 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:38" (1/1) ... [2024-11-27 20:13:38,941 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 20:13:38,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:38" (1/1) ... [2024-11-27 20:13:38,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:38" (1/1) ... [2024-11-27 20:13:38,961 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:38" (1/1) ... [2024-11-27 20:13:38,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:38" (1/1) ... [2024-11-27 20:13:38,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:38" (1/1) ... [2024-11-27 20:13:38,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:38" (1/1) ... [2024-11-27 20:13:38,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:38" (1/1) ... [2024-11-27 20:13:38,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:13:38,995 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:13:38,995 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:13:38,995 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:13:38,996 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:38" (1/1) ... [2024-11-27 20:13:39,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:13:39,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:13:39,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:13:39,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:13:39,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:13:39,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:13:39,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:13:39,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:13:39,200 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:13:39,202 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:13:39,973 INFO L? ?]: Removed 175 outVars from TransFormulas that were not future-live. [2024-11-27 20:13:39,973 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:13:39,987 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:13:39,989 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-27 20:13:39,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:13:39 BoogieIcfgContainer [2024-11-27 20:13:39,989 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:13:39,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:13:39,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:13:39,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:13:40,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:13:38" (1/3) ... [2024-11-27 20:13:40,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbb1714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:13:40, skipping insertion in model container [2024-11-27 20:13:40,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:38" (2/3) ... [2024-11-27 20:13:40,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbb1714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:13:40, skipping insertion in model container [2024-11-27 20:13:40,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:13:39" (3/3) ... [2024-11-27 20:13:40,004 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_segments.c [2024-11-27 20:13:40,027 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:13:40,029 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_segments.c that has 1 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 20:13:40,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:13:40,109 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;@5787670f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:13:40,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:13:40,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 80 states have (on average 1.4875) internal successors, (119), 81 states have internal predecessors, (119), 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-11-27 20:13:40,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-27 20:13:40,121 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:40,121 INFO L218 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] [2024-11-27 20:13:40,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:40,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:40,128 INFO L85 PathProgramCache]: Analyzing trace with hash 365214336, now seen corresponding path program 1 times [2024-11-27 20:13:40,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:40,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933191687] [2024-11-27 20:13:40,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:40,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:41,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:41,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933191687] [2024-11-27 20:13:41,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933191687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:41,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:41,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:13:41,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633294495] [2024-11-27 20:13:41,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:41,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:13:41,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:41,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:13:41,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:13:41,163 INFO L87 Difference]: Start difference. First operand has 82 states, 80 states have (on average 1.4875) internal successors, (119), 81 states have internal predecessors, (119), 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 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-11-27 20:13:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:41,214 INFO L93 Difference]: Finished difference Result 157 states and 231 transitions. [2024-11-27 20:13:41,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:13:41,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2024-11-27 20:13:41,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:41,223 INFO L225 Difference]: With dead ends: 157 [2024-11-27 20:13:41,224 INFO L226 Difference]: Without dead ends: 81 [2024-11-27 20:13:41,227 INFO L434 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-11-27 20:13:41,230 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 333 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-11-27 20:13:41,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 333 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:13:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-27 20:13:41,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-27 20:13:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.4625) internal successors, (117), 80 states have internal predecessors, (117), 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-11-27 20:13:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2024-11-27 20:13:41,265 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 31 [2024-11-27 20:13:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:41,266 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2024-11-27 20:13:41,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-11-27 20:13:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2024-11-27 20:13:41,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-27 20:13:41,267 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:41,267 INFO L218 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] [2024-11-27 20:13:41,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:13:41,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:41,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:41,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1561562150, now seen corresponding path program 1 times [2024-11-27 20:13:41,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:41,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126356525] [2024-11-27 20:13:41,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:41,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:41,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:41,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126356525] [2024-11-27 20:13:41,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126356525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:41,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:41,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:13:41,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136332210] [2024-11-27 20:13:41,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:41,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:13:41,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:41,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:13:41,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:13:41,597 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-11-27 20:13:41,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:41,657 INFO L93 Difference]: Finished difference Result 158 states and 229 transitions. [2024-11-27 20:13:41,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:13:41,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2024-11-27 20:13:41,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:41,661 INFO L225 Difference]: With dead ends: 158 [2024-11-27 20:13:41,661 INFO L226 Difference]: Without dead ends: 83 [2024-11-27 20:13:41,662 INFO L434 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-11-27 20:13:41,663 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 329 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-11-27 20:13:41,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 329 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:13:41,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-27 20:13:41,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-27 20:13:41,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.451219512195122) internal successors, (119), 82 states have internal predecessors, (119), 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-11-27 20:13:41,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 119 transitions. [2024-11-27 20:13:41,678 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 119 transitions. Word has length 32 [2024-11-27 20:13:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:41,681 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 119 transitions. [2024-11-27 20:13:41,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-11-27 20:13:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 119 transitions. [2024-11-27 20:13:41,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-27 20:13:41,683 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:41,684 INFO L218 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] [2024-11-27 20:13:41,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:13:41,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:41,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:41,686 INFO L85 PathProgramCache]: Analyzing trace with hash 2033215129, now seen corresponding path program 1 times [2024-11-27 20:13:41,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:41,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304513308] [2024-11-27 20:13:41,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:41,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:42,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304513308] [2024-11-27 20:13:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304513308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:42,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:42,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:13:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610853045] [2024-11-27 20:13:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:42,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:13:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:42,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:13:42,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:13:42,340 INFO L87 Difference]: Start difference. First operand 83 states and 119 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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-11-27 20:13:42,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:42,465 INFO L93 Difference]: Finished difference Result 164 states and 236 transitions. [2024-11-27 20:13:42,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:13:42,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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 33 [2024-11-27 20:13:42,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:42,470 INFO L225 Difference]: With dead ends: 164 [2024-11-27 20:13:42,470 INFO L226 Difference]: Without dead ends: 87 [2024-11-27 20:13:42,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:13:42,471 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 98 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:42,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 415 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:13:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-27 20:13:42,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-11-27 20:13:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 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-11-27 20:13:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2024-11-27 20:13:42,482 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 33 [2024-11-27 20:13:42,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:42,483 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2024-11-27 20:13:42,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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-11-27 20:13:42,483 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2024-11-27 20:13:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-27 20:13:42,484 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:42,484 INFO L218 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] [2024-11-27 20:13:42,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:13:42,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:42,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:42,485 INFO L85 PathProgramCache]: Analyzing trace with hash 169704829, now seen corresponding path program 1 times [2024-11-27 20:13:42,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:42,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115636571] [2024-11-27 20:13:42,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:42,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:43,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:43,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115636571] [2024-11-27 20:13:43,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115636571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:43,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:43,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 20:13:43,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123697135] [2024-11-27 20:13:43,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:43,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:13:43,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:43,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:13:43,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:13:43,826 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-11-27 20:13:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:43,994 INFO L93 Difference]: Finished difference Result 174 states and 248 transitions. [2024-11-27 20:13:43,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:13:43,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 34 [2024-11-27 20:13:43,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:44,001 INFO L225 Difference]: With dead ends: 174 [2024-11-27 20:13:44,001 INFO L226 Difference]: Without dead ends: 94 [2024-11-27 20:13:44,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:13:44,006 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 122 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:44,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 535 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:13:44,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-27 20:13:44,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2024-11-27 20:13:44,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 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-11-27 20:13:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-11-27 20:13:44,016 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 34 [2024-11-27 20:13:44,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:44,016 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-11-27 20:13:44,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-11-27 20:13:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-11-27 20:13:44,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-27 20:13:44,017 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:44,017 INFO L218 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] [2024-11-27 20:13:44,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:13:44,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:44,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:44,018 INFO L85 PathProgramCache]: Analyzing trace with hash -301874261, now seen corresponding path program 1 times [2024-11-27 20:13:44,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:44,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684786333] [2024-11-27 20:13:44,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:44,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:45,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:45,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684786333] [2024-11-27 20:13:45,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684786333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:45,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:45,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 20:13:45,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830695758] [2024-11-27 20:13:45,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:45,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 20:13:45,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:45,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 20:13:45,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:13:45,030 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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-11-27 20:13:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:45,221 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2024-11-27 20:13:45,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:13:45,222 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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 35 [2024-11-27 20:13:45,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:45,223 INFO L225 Difference]: With dead ends: 184 [2024-11-27 20:13:45,223 INFO L226 Difference]: Without dead ends: 99 [2024-11-27 20:13:45,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:13:45,225 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 114 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:45,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 812 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:13:45,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-27 20:13:45,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-11-27 20:13:45,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 95 states have internal predecessors, (134), 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-11-27 20:13:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2024-11-27 20:13:45,235 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 35 [2024-11-27 20:13:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:45,235 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2024-11-27 20:13:45,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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-11-27 20:13:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2024-11-27 20:13:45,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-27 20:13:45,237 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:45,237 INFO L218 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] [2024-11-27 20:13:45,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:13:45,237 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:45,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:45,238 INFO L85 PathProgramCache]: Analyzing trace with hash -37543868, now seen corresponding path program 1 times [2024-11-27 20:13:45,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:45,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102370314] [2024-11-27 20:13:45,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:45,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:45,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:45,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102370314] [2024-11-27 20:13:45,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102370314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:45,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:45,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:13:45,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68804481] [2024-11-27 20:13:45,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:45,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:13:45,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:45,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:13:45,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:45,446 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-11-27 20:13:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:45,539 INFO L93 Difference]: Finished difference Result 270 states and 377 transitions. [2024-11-27 20:13:45,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:13:45,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2024-11-27 20:13:45,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:45,543 INFO L225 Difference]: With dead ends: 270 [2024-11-27 20:13:45,543 INFO L226 Difference]: Without dead ends: 180 [2024-11-27 20:13:45,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:13:45,545 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 301 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:45,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 312 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:13:45,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-27 20:13:45,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 108. [2024-11-27 20:13:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.4018691588785046) internal successors, (150), 107 states have internal predecessors, (150), 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-11-27 20:13:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2024-11-27 20:13:45,567 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 150 transitions. Word has length 35 [2024-11-27 20:13:45,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:45,567 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 150 transitions. [2024-11-27 20:13:45,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-11-27 20:13:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 150 transitions. [2024-11-27 20:13:45,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-27 20:13:45,571 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:45,572 INFO L218 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] [2024-11-27 20:13:45,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:13:45,572 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:45,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:45,572 INFO L85 PathProgramCache]: Analyzing trace with hash 580893341, now seen corresponding path program 1 times [2024-11-27 20:13:45,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:45,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828213446] [2024-11-27 20:13:45,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:45,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:45,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:45,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828213446] [2024-11-27 20:13:45,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828213446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:45,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:45,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:13:45,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162948405] [2024-11-27 20:13:45,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:45,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:13:45,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:45,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:13:45,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:45,792 INFO L87 Difference]: Start difference. First operand 108 states and 150 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-11-27 20:13:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:45,882 INFO L93 Difference]: Finished difference Result 264 states and 366 transitions. [2024-11-27 20:13:45,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:13:45,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2024-11-27 20:13:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:45,884 INFO L225 Difference]: With dead ends: 264 [2024-11-27 20:13:45,884 INFO L226 Difference]: Without dead ends: 170 [2024-11-27 20:13:45,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:13:45,885 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 289 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:45,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 312 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:13:45,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-27 20:13:45,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 104. [2024-11-27 20:13:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 103 states have internal predecessors, (144), 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-11-27 20:13:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 144 transitions. [2024-11-27 20:13:45,893 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 144 transitions. Word has length 35 [2024-11-27 20:13:45,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:45,893 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 144 transitions. [2024-11-27 20:13:45,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-11-27 20:13:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 144 transitions. [2024-11-27 20:13:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-27 20:13:45,894 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:45,894 INFO L218 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] [2024-11-27 20:13:45,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 20:13:45,895 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:45,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1650261173, now seen corresponding path program 1 times [2024-11-27 20:13:45,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:45,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806979761] [2024-11-27 20:13:45,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:45,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:46,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:46,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:46,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806979761] [2024-11-27 20:13:46,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806979761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:46,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:46,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 20:13:46,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414520661] [2024-11-27 20:13:46,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:46,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:13:46,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:46,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:13:46,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:13:46,711 INFO L87 Difference]: Start difference. First operand 104 states and 144 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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-11-27 20:13:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:46,927 INFO L93 Difference]: Finished difference Result 209 states and 292 transitions. [2024-11-27 20:13:46,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 20:13:46,927 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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 36 [2024-11-27 20:13:46,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:46,928 INFO L225 Difference]: With dead ends: 209 [2024-11-27 20:13:46,928 INFO L226 Difference]: Without dead ends: 119 [2024-11-27 20:13:46,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:13:46,930 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 121 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:46,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 783 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:13:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-27 20:13:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2024-11-27 20:13:46,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 112 states have internal predecessors, (157), 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-11-27 20:13:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2024-11-27 20:13:46,936 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 36 [2024-11-27 20:13:46,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:46,937 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2024-11-27 20:13:46,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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-11-27 20:13:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2024-11-27 20:13:46,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-27 20:13:46,938 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:46,938 INFO L218 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] [2024-11-27 20:13:46,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:13:46,938 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:46,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:46,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1263227207, now seen corresponding path program 1 times [2024-11-27 20:13:46,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:46,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281360801] [2024-11-27 20:13:46,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:46,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:47,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:47,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281360801] [2024-11-27 20:13:47,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281360801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:47,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:47,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-27 20:13:47,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106853325] [2024-11-27 20:13:47,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:47,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-27 20:13:47,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:47,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-27 20:13:47,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-27 20:13:47,846 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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-11-27 20:13:48,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:48,204 INFO L93 Difference]: Finished difference Result 226 states and 316 transitions. [2024-11-27 20:13:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:13:48,205 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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 37 [2024-11-27 20:13:48,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:48,206 INFO L225 Difference]: With dead ends: 226 [2024-11-27 20:13:48,206 INFO L226 Difference]: Without dead ends: 127 [2024-11-27 20:13:48,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-27 20:13:48,207 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 126 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:48,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1111 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:13:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-27 20:13:48,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2024-11-27 20:13:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.4) internal successors, (168), 120 states have internal predecessors, (168), 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-11-27 20:13:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 168 transitions. [2024-11-27 20:13:48,215 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 168 transitions. Word has length 37 [2024-11-27 20:13:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:48,216 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 168 transitions. [2024-11-27 20:13:48,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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-11-27 20:13:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 168 transitions. [2024-11-27 20:13:48,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-27 20:13:48,217 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:48,217 INFO L218 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] [2024-11-27 20:13:48,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:13:48,218 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:48,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:48,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1918885507, now seen corresponding path program 1 times [2024-11-27 20:13:48,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:48,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141194389] [2024-11-27 20:13:48,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:48,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:49,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:49,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141194389] [2024-11-27 20:13:49,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141194389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:49,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:49,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-27 20:13:49,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765859995] [2024-11-27 20:13:49,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:49,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-27 20:13:49,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:49,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-27 20:13:49,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-27 20:13:49,050 INFO L87 Difference]: Start difference. First operand 121 states and 168 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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-11-27 20:13:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:49,445 INFO L93 Difference]: Finished difference Result 253 states and 353 transitions. [2024-11-27 20:13:49,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 20:13:49,449 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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 37 [2024-11-27 20:13:49,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:49,450 INFO L225 Difference]: With dead ends: 253 [2024-11-27 20:13:49,450 INFO L226 Difference]: Without dead ends: 146 [2024-11-27 20:13:49,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-27 20:13:49,451 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 135 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:49,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1235 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:13:49,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-27 20:13:49,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 139. [2024-11-27 20:13:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.4057971014492754) internal successors, (194), 138 states have internal predecessors, (194), 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-11-27 20:13:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 194 transitions. [2024-11-27 20:13:49,458 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 194 transitions. Word has length 37 [2024-11-27 20:13:49,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:49,458 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 194 transitions. [2024-11-27 20:13:49,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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-11-27 20:13:49,458 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2024-11-27 20:13:49,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-27 20:13:49,459 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:49,460 INFO L218 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] [2024-11-27 20:13:49,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:13:49,460 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:49,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:49,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1515202326, now seen corresponding path program 1 times [2024-11-27 20:13:49,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:49,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738998071] [2024-11-27 20:13:49,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:49,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:49,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:49,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738998071] [2024-11-27 20:13:49,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738998071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:49,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:49,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:13:49,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965744201] [2024-11-27 20:13:49,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:49,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:13:49,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:49,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:13:49,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:49,622 INFO L87 Difference]: Start difference. First operand 139 states and 194 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-11-27 20:13:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:49,701 INFO L93 Difference]: Finished difference Result 350 states and 487 transitions. [2024-11-27 20:13:49,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:13:49,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2024-11-27 20:13:49,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:49,703 INFO L225 Difference]: With dead ends: 350 [2024-11-27 20:13:49,703 INFO L226 Difference]: Without dead ends: 225 [2024-11-27 20:13:49,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:13:49,704 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 269 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:49,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 312 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:13:49,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-27 20:13:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 159. [2024-11-27 20:13:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.379746835443038) internal successors, (218), 158 states have internal predecessors, (218), 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-11-27 20:13:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 218 transitions. [2024-11-27 20:13:49,719 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 218 transitions. Word has length 37 [2024-11-27 20:13:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:49,722 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 218 transitions. [2024-11-27 20:13:49,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-11-27 20:13:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 218 transitions. [2024-11-27 20:13:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-27 20:13:49,724 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:49,724 INFO L218 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] [2024-11-27 20:13:49,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:13:49,724 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:49,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:49,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1136610428, now seen corresponding path program 1 times [2024-11-27 20:13:49,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:49,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15323034] [2024-11-27 20:13:49,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:49,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:49,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:49,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15323034] [2024-11-27 20:13:49,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15323034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:49,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:49,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:13:49,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146854783] [2024-11-27 20:13:49,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:49,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:13:49,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:49,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:13:49,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:49,913 INFO L87 Difference]: Start difference. First operand 159 states and 218 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-11-27 20:13:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:49,986 INFO L93 Difference]: Finished difference Result 343 states and 474 transitions. [2024-11-27 20:13:49,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:13:49,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2024-11-27 20:13:49,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:49,990 INFO L225 Difference]: With dead ends: 343 [2024-11-27 20:13:49,993 INFO L226 Difference]: Without dead ends: 206 [2024-11-27 20:13:49,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:13:49,994 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 258 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:49,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 312 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:13:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-27 20:13:50,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 149. [2024-11-27 20:13:50,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.3783783783783783) internal successors, (204), 148 states have internal predecessors, (204), 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-11-27 20:13:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 204 transitions. [2024-11-27 20:13:50,006 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 204 transitions. Word has length 37 [2024-11-27 20:13:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:50,006 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 204 transitions. [2024-11-27 20:13:50,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-11-27 20:13:50,007 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 204 transitions. [2024-11-27 20:13:50,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-27 20:13:50,008 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:50,010 INFO L218 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] [2024-11-27 20:13:50,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 20:13:50,011 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:50,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:50,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1881024206, now seen corresponding path program 1 times [2024-11-27 20:13:50,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:50,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649006425] [2024-11-27 20:13:50,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:50,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:50,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:50,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649006425] [2024-11-27 20:13:50,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649006425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:50,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:50,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:13:50,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584320286] [2024-11-27 20:13:50,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:50,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:13:50,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:50,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:13:50,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:50,165 INFO L87 Difference]: Start difference. First operand 149 states and 204 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:50,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:50,236 INFO L93 Difference]: Finished difference Result 325 states and 449 transitions. [2024-11-27 20:13:50,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:13:50,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-27 20:13:50,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:50,238 INFO L225 Difference]: With dead ends: 325 [2024-11-27 20:13:50,238 INFO L226 Difference]: Without dead ends: 200 [2024-11-27 20:13:50,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:13:50,239 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 240 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:50,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 312 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:13:50,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-27 20:13:50,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 157. [2024-11-27 20:13:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.3653846153846154) internal successors, (213), 156 states have internal predecessors, (213), 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-11-27 20:13:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 213 transitions. [2024-11-27 20:13:50,246 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 213 transitions. Word has length 38 [2024-11-27 20:13:50,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:50,247 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 213 transitions. [2024-11-27 20:13:50,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 213 transitions. [2024-11-27 20:13:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-27 20:13:50,248 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:50,248 INFO L218 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] [2024-11-27 20:13:50,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 20:13:50,248 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:50,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:50,249 INFO L85 PathProgramCache]: Analyzing trace with hash -2086330599, now seen corresponding path program 1 times [2024-11-27 20:13:50,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:50,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029208546] [2024-11-27 20:13:50,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:50,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:13:50,286 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:13:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:13:50,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 20:13:50,345 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:13:50,346 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 20:13:50,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 20:13:50,352 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:50,393 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:13:50,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:13:50 BoogieIcfgContainer [2024-11-27 20:13:50,396 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:13:50,397 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:13:50,397 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:13:50,397 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:13:50,398 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:13:39" (3/4) ... [2024-11-27 20:13:50,401 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 20:13:50,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:13:50,403 INFO L158 Benchmark]: Toolchain (without parser) took 12140.25ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 92.2MB in the beginning and 117.1MB in the end (delta: -24.9MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. [2024-11-27 20:13:50,403 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 72.7MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:13:50,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.44ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 76.9MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:13:50,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.06ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 69.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:13:50,404 INFO L158 Benchmark]: Boogie Preprocessor took 127.03ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 65.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:13:50,405 INFO L158 Benchmark]: RCFGBuilder took 994.48ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 75.7MB in the end (delta: -10.5MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2024-11-27 20:13:50,405 INFO L158 Benchmark]: TraceAbstraction took 10403.38ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 75.1MB in the beginning and 117.1MB in the end (delta: -42.0MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2024-11-27 20:13:50,405 INFO L158 Benchmark]: Witness Printer took 4.94ms. Allocated memory is still 226.5MB. Free memory was 117.1MB in the beginning and 117.1MB in the end (delta: 29.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:13:50,407 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.42ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 72.7MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.44ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 76.9MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.06ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 69.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.03ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 65.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 994.48ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 75.7MB in the end (delta: -10.5MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10403.38ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 75.1MB in the beginning and 117.1MB in the end (delta: -42.0MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. * Witness Printer took 4.94ms. Allocated memory is still 226.5MB. Free memory was 117.1MB in the beginning and 117.1MB in the end (delta: 29.4kB). There was no memory consumed. 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 113. 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_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 8); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (8 - 1); [L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 32); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (32 - 1); [L35] const SORT_52 mask_SORT_52 = (SORT_52)-1 >> (sizeof(SORT_52) * 8 - 2); [L36] const SORT_52 msb_SORT_52 = (SORT_52)1 << (2 - 1); [L38] const SORT_54 mask_SORT_54 = (SORT_54)-1 >> (sizeof(SORT_54) * 8 - 3); [L39] const SORT_54 msb_SORT_54 = (SORT_54)1 << (3 - 1); [L41] const SORT_4 var_5 = 0; [L42] const SORT_8 var_10 = 0; [L43] const SORT_8 var_13 = 1; [L44] const SORT_8 var_17 = 2; [L45] const SORT_8 var_21 = 3; [L46] const SORT_8 var_25 = 4; [L47] const SORT_1 var_30 = 1; [L48] const SORT_4 var_41 = 1; [L49] const SORT_4 var_44 = 4; [L50] const SORT_4 var_45 = 3; [L51] const SORT_4 var_50 = 2; [L53] SORT_1 input_2; [L54] SORT_1 input_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L56] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L58] SORT_4 init_7_arg_1 = var_5; [L59] state_6 = init_7_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L62] input_2 = __VERIFIER_nondet_uchar() [L63] input_3 = __VERIFIER_nondet_uchar() [L64] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L64] input_3 = input_3 & mask_SORT_1 [L67] SORT_4 var_9_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9_arg_0=0] [L68] EXPR var_9_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L68] var_9_arg_0 = var_9_arg_0 & mask_SORT_4 [L69] SORT_8 var_9 = var_9_arg_0; [L70] SORT_8 var_11_arg_0 = var_9; [L71] SORT_8 var_11_arg_1 = var_10; [L72] SORT_1 var_11 = var_11_arg_0 == var_11_arg_1; [L73] SORT_4 var_12_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_11=1, var_12_arg_0=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L74] EXPR var_12_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_11=1, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L74] var_12_arg_0 = var_12_arg_0 & mask_SORT_4 [L75] SORT_8 var_12 = var_12_arg_0; [L76] SORT_8 var_14_arg_0 = var_12; [L77] SORT_8 var_14_arg_1 = var_13; [L78] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L79] SORT_1 var_15_arg_0 = var_11; [L80] SORT_1 var_15_arg_1 = var_14; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_15_arg_0=1, var_15_arg_1=0, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L81] EXPR var_15_arg_0 | var_15_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L81] SORT_1 var_15 = var_15_arg_0 | var_15_arg_1; [L82] SORT_4 var_16_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_15=1, var_16_arg_0=0, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L83] EXPR var_16_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_15=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L83] var_16_arg_0 = var_16_arg_0 & mask_SORT_4 [L84] SORT_8 var_16 = var_16_arg_0; [L85] SORT_8 var_18_arg_0 = var_16; [L86] SORT_8 var_18_arg_1 = var_17; [L87] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L88] SORT_1 var_19_arg_0 = var_15; [L89] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_19_arg_0=1, var_19_arg_1=0, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L90] EXPR var_19_arg_0 | var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L90] SORT_1 var_19 = var_19_arg_0 | var_19_arg_1; [L91] SORT_4 var_20_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_19=1, var_20_arg_0=0, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L92] EXPR var_20_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_19=1, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L92] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L93] SORT_8 var_20 = var_20_arg_0; [L94] SORT_8 var_22_arg_0 = var_20; [L95] SORT_8 var_22_arg_1 = var_21; [L96] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L97] SORT_1 var_23_arg_0 = var_19; [L98] SORT_1 var_23_arg_1 = var_22; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_23_arg_0=1, var_23_arg_1=0, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L99] EXPR var_23_arg_0 | var_23_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L99] SORT_1 var_23 = var_23_arg_0 | var_23_arg_1; [L100] SORT_4 var_24_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_23=1, var_24_arg_0=0, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L101] EXPR var_24_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_23=1, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L101] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L102] SORT_8 var_24 = var_24_arg_0; [L103] SORT_8 var_26_arg_0 = var_24; [L104] SORT_8 var_26_arg_1 = var_25; [L105] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L106] SORT_1 var_27_arg_0 = var_23; [L107] SORT_1 var_27_arg_1 = var_26; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_27_arg_0=1, var_27_arg_1=0, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L108] EXPR var_27_arg_0 | var_27_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L108] SORT_1 var_27 = var_27_arg_0 | var_27_arg_1; [L109] SORT_1 var_31_arg_0 = var_27; [L110] SORT_1 var_31 = ~var_31_arg_0; [L111] SORT_1 var_32_arg_0 = var_30; [L112] SORT_1 var_32_arg_1 = var_31; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_32_arg_0=1, var_32_arg_1=-2, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L113] EXPR var_32_arg_0 & var_32_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L113] SORT_1 var_32 = var_32_arg_0 & var_32_arg_1; [L114] EXPR var_32 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L114] var_32 = var_32 & mask_SORT_1 [L115] SORT_1 bad_33_arg_0 = var_32; [L116] CALL __VERIFIER_assert(!(bad_33_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2073 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2073 mSDsluCounter, 7113 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5750 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1181 IncrementalHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1363 mSDtfsCounter, 1181 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=11, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 330 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 495 NumberOfCodeBlocks, 495 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 444 ConstructedInterpolants, 0 QuantifiedInterpolants, 1385 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-27 20:13:50,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB --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 827228a8fb731d7038bb1b8c7cce3c35edda9a5c3ee552084966688fbdc104d2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:13:53,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:13:53,662 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-27 20:13:53,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:13:53,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:13:53,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:13:53,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:13:53,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:13:53,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:13:53,705 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:13:53,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:13:53,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:13:53,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:13:53,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:13:53,706 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:13:53,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:13:53,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:13:53,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:13:53,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:13:53,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:13:53,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:13:53,707 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:13:53,707 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 20:13:53,708 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 20:13:53,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:13:53,708 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:13:53,708 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:13:53,708 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:13:53,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:13:53,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:13:53,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:13:53,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:13:53,709 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:13:53,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:13:53,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:13:53,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:13:53,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:13:53,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:13:53,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:13:53,710 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:13:53,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:13:53,710 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 20:13:53,710 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 20:13:53,710 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:13:53,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:13:53,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:13:53,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:13:53,711 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 827228a8fb731d7038bb1b8c7cce3c35edda9a5c3ee552084966688fbdc104d2 [2024-11-27 20:13:54,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:13:54,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:13:54,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:13:54,108 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:13:54,108 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:13:54,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c [2024-11-27 20:13:57,242 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/data/f500f87ce/33d083bc67984a559cee751347479903/FLAGf11044219 [2024-11-27 20:13:57,580 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:13:57,581 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c [2024-11-27 20:13:57,600 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/data/f500f87ce/33d083bc67984a559cee751347479903/FLAGf11044219 [2024-11-27 20:13:57,625 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/data/f500f87ce/33d083bc67984a559cee751347479903 [2024-11-27 20:13:57,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:13:57,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:13:57,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:13:57,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:13:57,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:13:57,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:13:57" (1/1) ... [2024-11-27 20:13:57,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6214c72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:57, skipping insertion in model container [2024-11-27 20:13:57,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:13:57" (1/1) ... [2024-11-27 20:13:57,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:13:57,868 WARN L250 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_363dfd4e-2ff7-4986-afe4-869e0b8897ca/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c[1250,1263] [2024-11-27 20:13:57,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:13:58,009 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:13:58,022 WARN L250 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_363dfd4e-2ff7-4986-afe4-869e0b8897ca/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c[1250,1263] [2024-11-27 20:13:58,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:13:58,093 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:13:58,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:58 WrapperNode [2024-11-27 20:13:58,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:13:58,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:13:58,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:13:58,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:13:58,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:58" (1/1) ... [2024-11-27 20:13:58,115 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:58" (1/1) ... [2024-11-27 20:13:58,156 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 163 [2024-11-27 20:13:58,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:13:58,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:13:58,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:13:58,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:13:58,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:58" (1/1) ... [2024-11-27 20:13:58,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:58" (1/1) ... [2024-11-27 20:13:58,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:58" (1/1) ... [2024-11-27 20:13:58,211 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 20:13:58,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:58" (1/1) ... [2024-11-27 20:13:58,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:58" (1/1) ... [2024-11-27 20:13:58,227 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:58" (1/1) ... [2024-11-27 20:13:58,229 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:58" (1/1) ... [2024-11-27 20:13:58,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:58" (1/1) ... [2024-11-27 20:13:58,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:58" (1/1) ... [2024-11-27 20:13:58,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:58" (1/1) ... [2024-11-27 20:13:58,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:13:58,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:13:58,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:13:58,254 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:13:58,256 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:58" (1/1) ... [2024-11-27 20:13:58,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:13:58,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:13:58,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:13:58,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:13:58,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:13:58,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 20:13:58,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:13:58,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:13:58,492 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:13:58,495 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:13:58,873 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-27 20:13:58,874 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:13:58,884 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:13:58,885 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-27 20:13:58,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:13:58 BoogieIcfgContainer [2024-11-27 20:13:58,886 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:13:58,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:13:58,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:13:58,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:13:58,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:13:57" (1/3) ... [2024-11-27 20:13:58,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60382577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:13:58, skipping insertion in model container [2024-11-27 20:13:58,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:13:58" (2/3) ... [2024-11-27 20:13:58,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60382577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:13:58, skipping insertion in model container [2024-11-27 20:13:58,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:13:58" (3/3) ... [2024-11-27 20:13:58,904 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_segments.c [2024-11-27 20:13:58,923 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:13:58,925 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_segments.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 20:13:58,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:13:59,000 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;@29923055, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:13:59,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:13:59,005 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-11-27 20:13:59,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-27 20:13:59,011 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:59,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-27 20:13:59,012 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:59,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:59,018 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-27 20:13:59,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:13:59,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [441187767] [2024-11-27 20:13:59,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:59,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:13:59,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:13:59,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:13:59,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:13:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:59,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-27 20:13:59,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:13:59,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:59,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:13:59,618 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:13:59,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441187767] [2024-11-27 20:13:59,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441187767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:59,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:59,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:13:59,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969248417] [2024-11-27 20:13:59,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:59,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:13:59,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:13:59,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:13:59,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:13:59,653 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-11-27 20:13:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:59,724 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-27 20:13:59,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:13:59,729 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-11-27 20:13:59,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:59,739 INFO L225 Difference]: With dead ends: 18 [2024-11-27 20:13:59,739 INFO L226 Difference]: Without dead ends: 10 [2024-11-27 20:13:59,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:59,747 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:59,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:13:59,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-27 20:13:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-27 20:13:59,779 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-11-27 20:13:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-27 20:13:59,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-27 20:13:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:59,784 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-27 20:13:59,807 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-11-27 20:13:59,807 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-27 20:13:59,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-27 20:13:59,808 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:59,808 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:59,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:14:00,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:00,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:00,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:00,010 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-27 20:14:00,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:00,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313849047] [2024-11-27 20:14:00,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:00,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:00,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:00,017 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:00,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:14:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:00,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-27 20:14:00,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:02,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:02,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:14:32,524 WARN L286 SmtUtils]: Spent 11.05s on a formula simplification that was a NOOP. DAG size: 509 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 20:15:07,485 WARN L286 SmtUtils]: Spent 10.99s on a formula simplification that was a NOOP. DAG size: 512 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 20:15:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:15:29,314 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:15:29,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313849047] [2024-11-27 20:15:29,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313849047] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:15:29,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:15:29,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-27 20:15:29,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910485127] [2024-11-27 20:15:29,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:15:29,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 20:15:29,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:15:29,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 20:15:29,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:15:29,317 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:15:29,563 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-27 20:15:29,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:15:29,563 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-27 20:15:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:15:29,564 INFO L225 Difference]: With dead ends: 15 [2024-11-27 20:15:29,564 INFO L226 Difference]: Without dead ends: 13 [2024-11-27 20:15:29,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:15:29,565 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:15:29,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:15:29,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-27 20:15:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-27 20:15:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-11-27 20:15:29,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-27 20:15:29,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-27 20:15:29,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:15:29,571 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-27 20:15:29,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:29,571 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-27 20:15:29,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-27 20:15:29,571 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:15:29,572 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-27 20:15:29,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 20:15:29,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:29,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:15:29,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:15:29,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-27 20:15:29,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:15:29,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2022607082] [2024-11-27 20:15:29,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:15:29,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:29,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:15:29,778 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:15:29,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_363dfd4e-2ff7-4986-afe4-869e0b8897ca/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:15:30,009 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:15:30,009 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:15:30,013 WARN L254 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 107 conjuncts are in the unsatisfiable core [2024-11-27 20:15:30,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:15:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 20:15:33,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:17:21,002 WARN L286 SmtUtils]: Spent 36.36s on a formula simplification that was a NOOP. DAG size: 622 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 20:20:39,177 WARN L286 SmtUtils]: Spent 41.18s on a formula simplification that was a NOOP. DAG size: 625 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)