./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_3_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_3_4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd --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 32bit --witnessprinter.graph.data.programhash cdcc8697c8b9bd3a25c95b335058fb611b45ef6a0bd08057dccc283c9b370e3d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:00:42,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:00:42,389 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:00:42,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:00:42,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:00:42,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:00:42,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:00:42,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:00:42,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:00:42,439 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:00:42,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:00:42,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:00:42,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:00:42,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:00:42,441 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:00:42,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:00:42,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:00:42,442 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:00:42,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:00:42,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:00:42,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:00:42,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:00:42,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:00:42,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:00:42,443 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:00:42,443 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:00:42,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:00:42,443 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:00:42,443 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:00:42,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:00:42,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:00:42,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:00:42,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:00:42,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:00:42,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:00:42,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:00:42,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:00:42,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:00:42,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:00:42,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:00:42,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:00:42,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:00:42,446 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_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdcc8697c8b9bd3a25c95b335058fb611b45ef6a0bd08057dccc283c9b370e3d [2024-11-13 13:00:42,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:00:42,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:00:42,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:00:42,766 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:00:42,766 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:00:42,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/combinations/gcd_3+newton_3_4.i Unable to find full path for "g++" [2024-11-13 13:00:44,742 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:00:45,057 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:00:45,060 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/sv-benchmarks/c/combinations/gcd_3+newton_3_4.i [2024-11-13 13:00:45,071 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/data/f06233ec3/4c0870882c774f97a84f99e348cc069b/FLAG1c5693e86 [2024-11-13 13:00:45,093 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/data/f06233ec3/4c0870882c774f97a84f99e348cc069b [2024-11-13 13:00:45,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:00:45,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:00:45,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:00:45,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:00:45,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:00:45,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:00:45" (1/1) ... [2024-11-13 13:00:45,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a57dbd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:45, skipping insertion in model container [2024-11-13 13:00:45,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:00:45" (1/1) ... [2024-11-13 13:00:45,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:00:45,319 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_074b8d5a-6716-4e99-9126-9d47b52c0f25/sv-benchmarks/c/combinations/gcd_3+newton_3_4.i[1226,1239] [2024-11-13 13:00:45,365 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_074b8d5a-6716-4e99-9126-9d47b52c0f25/sv-benchmarks/c/combinations/gcd_3+newton_3_4.i[2862,2875] [2024-11-13 13:00:45,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:00:45,384 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:00:45,400 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_074b8d5a-6716-4e99-9126-9d47b52c0f25/sv-benchmarks/c/combinations/gcd_3+newton_3_4.i[1226,1239] [2024-11-13 13:00:45,423 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_074b8d5a-6716-4e99-9126-9d47b52c0f25/sv-benchmarks/c/combinations/gcd_3+newton_3_4.i[2862,2875] [2024-11-13 13:00:45,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:00:45,445 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:00:45,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:45 WrapperNode [2024-11-13 13:00:45,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:00:45,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:00:45,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:00:45,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:00:45,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:45" (1/1) ... [2024-11-13 13:00:45,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:45" (1/1) ... [2024-11-13 13:00:45,498 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 90 [2024-11-13 13:00:45,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:00:45,500 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:00:45,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:00:45,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:00:45,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:45" (1/1) ... [2024-11-13 13:00:45,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:45" (1/1) ... [2024-11-13 13:00:45,514 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:45" (1/1) ... [2024-11-13 13:00:45,542 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-13 13:00:45,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:45" (1/1) ... [2024-11-13 13:00:45,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:45" (1/1) ... [2024-11-13 13:00:45,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:45" (1/1) ... [2024-11-13 13:00:45,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:45" (1/1) ... [2024-11-13 13:00:45,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:45" (1/1) ... [2024-11-13 13:00:45,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:45" (1/1) ... [2024-11-13 13:00:45,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:00:45,558 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:00:45,558 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:00:45,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:00:45,559 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:45" (1/1) ... [2024-11-13 13:00:45,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:00:45,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:45,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:00:45,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:00:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:00:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-13 13:00:45,625 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-13 13:00:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-13 13:00:45,625 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-13 13:00:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:00:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:00:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:00:45,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:00:45,721 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:00:45,722 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:00:45,983 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-13 13:00:45,983 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:00:45,999 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:00:46,001 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:00:46,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:00:46 BoogieIcfgContainer [2024-11-13 13:00:46,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:00:46,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:00:46,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:00:46,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:00:46,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:00:45" (1/3) ... [2024-11-13 13:00:46,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8c440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:00:46, skipping insertion in model container [2024-11-13 13:00:46,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:00:45" (2/3) ... [2024-11-13 13:00:46,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8c440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:00:46, skipping insertion in model container [2024-11-13 13:00:46,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:00:46" (3/3) ... [2024-11-13 13:00:46,015 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_3_4.i [2024-11-13 13:00:46,033 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:00:46,035 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_3+newton_3_4.i that has 3 procedures, 40 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2024-11-13 13:00:46,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:00:46,129 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;@596e3edf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:00:46,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 13:00:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:00:46,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 13:00:46,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:46,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:46,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:00:46,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:46,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1738968779, now seen corresponding path program 1 times [2024-11-13 13:00:46,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:46,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133208271] [2024-11-13 13:00:46,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:46,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:46,530 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-13 13:00:46,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:46,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133208271] [2024-11-13 13:00:46,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133208271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:46,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:46,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:00:46,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361472323] [2024-11-13 13:00:46,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:46,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:00:46,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:46,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:00:46,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:00:46,566 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-13 13:00:46,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:46,630 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2024-11-13 13:00:46,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:00:46,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Word has length 11 [2024-11-13 13:00:46,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:46,638 INFO L225 Difference]: With dead ends: 80 [2024-11-13 13:00:46,639 INFO L226 Difference]: Without dead ends: 34 [2024-11-13 13:00:46,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:00:46,644 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:46,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 127 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:00:46,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-13 13:00:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-13 13:00:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:00:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-13 13:00:46,680 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2024-11-13 13:00:46,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:46,681 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-13 13:00:46,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-13 13:00:46,681 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-13 13:00:46,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 13:00:46,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:46,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:46,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:00:46,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:00:46,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:46,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1746651891, now seen corresponding path program 1 times [2024-11-13 13:00:46,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:46,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75166751] [2024-11-13 13:00:46,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:46,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:46,947 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-13 13:00:46,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:00:46,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75166751] [2024-11-13 13:00:46,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75166751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:00:46,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:00:46,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:00:46,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257212575] [2024-11-13 13:00:46,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:00:46,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:00:46,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:00:46,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:00:46,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:00:46,950 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-13 13:00:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:00:47,000 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-13 13:00:47,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:00:47,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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) Word has length 11 [2024-11-13 13:00:47,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:00:47,001 INFO L225 Difference]: With dead ends: 39 [2024-11-13 13:00:47,002 INFO L226 Difference]: Without dead ends: 33 [2024-11-13 13:00:47,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:00:47,003 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:00:47,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 154 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:00:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-13 13:00:47,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-13 13:00:47,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:00:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-13 13:00:47,010 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2024-11-13 13:00:47,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:00:47,011 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-13 13:00:47,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-13 13:00:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-13 13:00:47,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 13:00:47,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:00:47,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:00:47,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:00:47,013 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:00:47,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:00:47,013 INFO L85 PathProgramCache]: Analyzing trace with hash -87073091, now seen corresponding path program 1 times [2024-11-13 13:00:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:00:47,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255463165] [2024-11-13 13:00:47,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:47,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:00:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:00:47,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1028009370] [2024-11-13 13:00:47,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:00:47,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:00:47,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:00:47,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:00:47,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:00:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:00:47,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 13:00:47,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:01:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:01:32,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:02:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:02:03,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:02:03,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255463165] [2024-11-13 13:02:03,185 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 13:02:03,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028009370] [2024-11-13 13:02:03,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028009370] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:02:03,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:02:03,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-13 13:02:03,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429356890] [2024-11-13 13:02:03,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:02:03,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 13:02:03,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:02:03,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 13:02:03,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=192, Unknown=25, NotChecked=0, Total=272 [2024-11-13 13:02:03,191 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-13 13:02:07,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:02:12,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:02:32,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:02:33,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:02:37,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:02:42,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:02:43,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:02:47,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:02:52,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:02:56,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:03:05,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:03:10,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:03:15,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:03:33,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 13:03:37,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 13:04:06,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 13:04:11,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 13:04:15,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 13:04:19,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 13:04:23,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 13:04:23,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:04:23,914 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-11-13 13:04:23,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 13:04:23,914 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 12 [2024-11-13 13:04:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:04:23,915 INFO L225 Difference]: With dead ends: 48 [2024-11-13 13:04:23,915 INFO L226 Difference]: Without dead ends: 38 [2024-11-13 13:04:23,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 131.2s TimeCoverageRelationStatistics Valid=106, Invalid=319, Unknown=37, NotChecked=0, Total=462 [2024-11-13 13:04:23,917 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 81.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:04:23,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 253 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 28 Unknown, 0 Unchecked, 81.4s Time] [2024-11-13 13:04:23,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-13 13:04:23,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-11-13 13:04:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:04:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-13 13:04:23,927 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 12 [2024-11-13 13:04:23,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:04:23,927 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-13 13:04:23,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-13 13:04:23,928 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-13 13:04:23,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 13:04:23,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:04:23,929 INFO L215 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:04:23,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 13:04:24,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:04:24,130 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:04:24,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:04:24,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1530851259, now seen corresponding path program 1 times [2024-11-13 13:04:24,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:04:24,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421008710] [2024-11-13 13:04:24,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:04:24,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:04:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:04:24,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [787296990] [2024-11-13 13:04:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:04:24,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:04:24,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:04:24,193 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:04:24,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:04:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:04:24,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 13:04:24,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:04:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:04:36,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:05:47,597 WARN L286 SmtUtils]: Spent 40.47s on a formula simplification. DAG size of input: 87 DAG size of output: 53 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:07:50,788 WARN L286 SmtUtils]: Spent 56.18s on a formula simplification. DAG size of input: 95 DAG size of output: 74 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:08:03,172 WARN L286 SmtUtils]: Spent 7.50s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:08:29,682 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:08:38,876 WARN L286 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:08:52,939 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:09:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:09:38,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:09:38,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421008710] [2024-11-13 13:09:38,143 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 13:09:38,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787296990] [2024-11-13 13:09:38,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787296990] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:09:38,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:09:38,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2024-11-13 13:09:38,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855995666] [2024-11-13 13:09:38,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:09:38,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 13:09:38,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:09:38,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 13:09:38,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=265, Unknown=29, NotChecked=0, Total=380 [2024-11-13 13:09:38,145 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-13 13:11:29,011 WARN L286 SmtUtils]: Spent 1.74m on a formula simplification. DAG size of input: 115 DAG size of output: 112 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:11:33,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 13:11:34,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 13:12:27,566 WARN L286 SmtUtils]: Spent 39.82s on a formula simplification. DAG size of input: 114 DAG size of output: 72 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:12:28,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 13:12:32,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 13:12:37,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:12:41,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 13:12:43,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:12:43,293 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2024-11-13 13:12:43,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 13:12:43,294 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-13 13:12:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:12:43,295 INFO L225 Difference]: With dead ends: 53 [2024-11-13 13:12:43,295 INFO L226 Difference]: Without dead ends: 44 [2024-11-13 13:12:43,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 327.1s TimeCoverageRelationStatistics Valid=143, Invalid=380, Unknown=29, NotChecked=0, Total=552 [2024-11-13 13:12:43,297 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:12:43,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 17 Unknown, 0 Unchecked, 24.6s Time] [2024-11-13 13:12:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-13 13:12:43,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2024-11-13 13:12:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 13:12:43,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-13 13:12:43,310 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2024-11-13 13:12:43,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:12:43,310 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-13 13:12:43,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-13 13:12:43,311 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-13 13:12:43,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:12:43,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:12:43,311 INFO L215 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:12:43,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 13:12:43,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:12:43,512 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:12:43,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:43,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1712852029, now seen corresponding path program 2 times [2024-11-13 13:12:43,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:43,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328589772] [2024-11-13 13:12:43,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:43,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:12:43,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154428213] [2024-11-13 13:12:43,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:12:43,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:12:43,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:12:43,647 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:12:43,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_074b8d5a-6716-4e99-9126-9d47b52c0f25/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:12:43,823 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:12:43,823 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:12:43,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-13 13:12:43,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:37,757 WARN L286 SmtUtils]: Spent 23.51s on a formula simplification. DAG size of input: 106 DAG size of output: 84 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:13:56,762 WARN L286 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:14:18,406 WARN L286 SmtUtils]: Spent 7.39s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:14:35,854 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 73 DAG size of output: 72 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:14:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:14:39,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:15:00,128 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse17 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse9 (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse6 (mod (+ .cse17 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse16 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (let ((.cse3 (< .cse6 .cse16)) (.cse1 (< 127 .cse6)) (.cse11 (< .cse6 128)) (.cse5 (< .cse9 128)) (.cse2 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse8 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse7 (< .cse9 .cse16)) (.cse4 (< 0 .cse15)) (.cse10 (< 127 .cse9)) (.cse0 (mod .cse17 256))) (and (or (< .cse0 128) (and (or .cse1 (and (or .cse2 .cse3 .cse4 .cse5 (and (forall ((v_subst_43 Int)) (not (= (mod v_subst_43 .cse6) 0))) (forall ((v_subst_44 Int)) (or (not (= (mod v_subst_44 .cse6) 0)) (< v_subst_44 0))))) (or (and (or (and (forall ((v_subst_36 Int)) (or (not (= (mod v_subst_36 .cse6) 0)) (< v_subst_36 0))) (forall ((v_subst_35 Int)) (not (= (mod v_subst_35 .cse6) 0)))) .cse2 .cse3 .cse4) (or .cse7 .cse8 .cse4 (and (forall ((v_subst_37 Int)) (not (= (mod v_subst_37 .cse9) 0))) (forall ((v_subst_38 Int)) (or (< v_subst_38 0) (not (= (mod v_subst_38 .cse9) 0))))))) .cse10))) (or (and (forall ((v_subst_54 Int)) (or (not (= (mod v_subst_54 .cse9) 0)) (< v_subst_54 0))) (forall ((v_subst_53 Int)) (not (= (mod v_subst_53 .cse9) 0)))) .cse7 .cse8 .cse11 .cse10 .cse4))) (or (< 127 .cse0) (let ((.cse14 (= .cse17 0))) (let ((.cse12 (< .cse0 .cse16)) (.cse13 (and (<= .cse15 0) (not .cse14)))) (and (or (and (or (and (or .cse12 .cse8 .cse13 (and (forall ((v_subst_24 Int)) (or (< v_subst_24 0) (not (= (mod v_subst_24 .cse0) 0)))) (forall ((v_subst_23 Int)) (not (= (mod v_subst_23 .cse0) 0))))) (or (and (or .cse14 (and (forall ((v_subst_19 Int)) (not (= 0 (mod v_subst_19 .cse6)))) (forall ((v_subst_20 Int)) (or (< v_subst_20 0) (not (= (mod v_subst_20 .cse6) 0))))) .cse3 .cse4) (or .cse12 .cse13 (and (forall ((v_subst_18 Int)) (or (not (= (mod v_subst_18 .cse0) 0)) (< v_subst_18 0))) (forall ((v_subst_17 Int)) (not (= (mod v_subst_17 .cse0) 0)))))) .cse2)) .cse5) (or .cse10 (and (or (and (or .cse12 .cse13 (and (forall ((v_subst_25 Int)) (not (= (mod v_subst_25 .cse0) 0))) (forall ((v_subst_26 Int)) (or (< v_subst_26 0) (not (= (mod v_subst_26 .cse0) 0)))))) (or (and (forall ((v_subst_28 Int)) (or (not (= 0 (mod v_subst_28 .cse6))) (< v_subst_28 0))) (forall ((v_subst_27 Int)) (not (= (mod v_subst_27 .cse6) 0)))) .cse3 .cse4)) .cse2) (or (and (or (and (forall ((v_subst_29 Int)) (not (= (mod v_subst_29 .cse9) 0))) (forall ((v_subst_30 Int)) (or (not (= (mod v_subst_30 .cse9) 0)) (< v_subst_30 0)))) .cse7 .cse4) (or .cse12 (and (forall ((v_subst_32 Int)) (or (not (= (mod v_subst_32 .cse0) 0)) (< v_subst_32 0))) (forall ((v_subst_31 Int)) (not (= (mod v_subst_31 .cse0) 0)))) .cse13)) .cse8)))) .cse1) (or .cse11 (and (or .cse5 (and (or .cse12 .cse13 .cse2 (and (forall ((v_subst_2 Int)) (or (< v_subst_2 0) (not (= (mod v_subst_2 .cse0) 0)))) (forall ((v_subst_1 Int)) (not (= (mod v_subst_1 .cse0) 0))))) (or .cse12 .cse8 .cse13 (and (forall ((v_subst_8 Int)) (or (not (= (mod v_subst_8 .cse0) 0)) (< v_subst_8 0))) (forall ((v_subst_7 Int)) (not (= 0 (mod v_subst_7 .cse0)))))))) (or (and (or .cse12 .cse13 .cse2 (and (forall ((v_subst_10 Int)) (or (< v_subst_10 0) (not (= (mod v_subst_10 .cse0) 0)))) (forall ((v_subst_9 Int)) (not (= (mod v_subst_9 .cse0) 0))))) (or .cse8 (and (or .cse14 .cse7 (and (forall ((v_subst_13 Int)) (not (= (mod v_subst_13 .cse9) 0))) (forall ((v_subst_14 Int)) (or (< v_subst_14 0) (not (= (mod v_subst_14 .cse9) 0))))) .cse4) (or .cse12 .cse13 (and (forall ((v_subst_15 Int)) (not (= (mod v_subst_15 .cse0) 0))) (forall ((v_subst_16 Int)) (or (< v_subst_16 0) (not (= (mod v_subst_16 .cse0) 0))))))))) .cse10))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (< |c_ULTIMATE.start_main1_~x~0#1| 1)) is different from true