./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/sum02-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/sum02-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 80bce81184682208d15520c2d0ae5d9c5f1236c4de557bfddd91c6f88a04aad8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:59:23,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:59:24,008 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:59:24,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:59:24,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:59:24,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:59:24,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:59:24,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:59:24,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:59:24,051 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:59:24,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:59:24,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:59:24,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:59:24,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:59:24,054 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:59:24,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:59:24,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:59:24,056 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:59:24,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:59:24,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:59:24,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:59:24,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:59:24,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:59:24,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:59:24,060 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:59:24,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:59:24,061 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:59:24,062 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:59:24,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:59:24,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:59:24,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:59:24,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:59:24,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:59:24,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:59:24,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:59:24,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:59:24,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:59:24,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:59:24,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:59:24,065 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:59:24,066 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:59:24,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:59:24,066 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 80bce81184682208d15520c2d0ae5d9c5f1236c4de557bfddd91c6f88a04aad8 [2023-11-29 05:59:24,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:59:24,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:59:24,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:59:24,350 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:59:24,350 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:59:24,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/bitvector/sum02-2.c [2023-11-29 05:59:27,216 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:59:27,396 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:59:27,397 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/sv-benchmarks/c/bitvector/sum02-2.c [2023-11-29 05:59:27,403 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/data/69428d7e6/bcc2c41e178348efbf86f5f425e4bf50/FLAG46a7c646f [2023-11-29 05:59:27,416 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/data/69428d7e6/bcc2c41e178348efbf86f5f425e4bf50 [2023-11-29 05:59:27,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:59:27,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:59:27,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:59:27,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:59:27,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:59:27,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:59:27" (1/1) ... [2023-11-29 05:59:27,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2378bb75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:59:27, skipping insertion in model container [2023-11-29 05:59:27,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:59:27" (1/1) ... [2023-11-29 05:59:27,450 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:59:27,589 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/sv-benchmarks/c/bitvector/sum02-2.c[711,724] [2023-11-29 05:59:27,605 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:59:27,616 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:59:27,631 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/sv-benchmarks/c/bitvector/sum02-2.c[711,724] [2023-11-29 05:59:27,635 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:59:27,650 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:59:27,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:59:27 WrapperNode [2023-11-29 05:59:27,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:59:27,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:59:27,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:59:27,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:59:27,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:59:27" (1/1) ... [2023-11-29 05:59:27,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:59:27" (1/1) ... [2023-11-29 05:59:27,680 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 36 [2023-11-29 05:59:27,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:59:27,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:59:27,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:59:27,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:59:27,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:59:27" (1/1) ... [2023-11-29 05:59:27,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:59:27" (1/1) ... [2023-11-29 05:59:27,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:59:27" (1/1) ... [2023-11-29 05:59:27,702 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 05:59:27,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:59:27" (1/1) ... [2023-11-29 05:59:27,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:59:27" (1/1) ... [2023-11-29 05:59:27,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:59:27" (1/1) ... [2023-11-29 05:59:27,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:59:27" (1/1) ... [2023-11-29 05:59:27,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:59:27" (1/1) ... [2023-11-29 05:59:27,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:59:27" (1/1) ... [2023-11-29 05:59:27,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:59:27,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:59:27,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:59:27,714 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:59:27,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:59:27" (1/1) ... [2023-11-29 05:59:27,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:59:27,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:27,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:59:27,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:59:27,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:59:27,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:59:27,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:59:27,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:59:27,849 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:59:27,851 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:59:27,969 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:59:28,001 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:59:28,001 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:59:28,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:59:28 BoogieIcfgContainer [2023-11-29 05:59:28,002 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:59:28,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:59:28,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:59:28,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:59:28,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:59:27" (1/3) ... [2023-11-29 05:59:28,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6092e784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:59:28, skipping insertion in model container [2023-11-29 05:59:28,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:59:27" (2/3) ... [2023-11-29 05:59:28,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6092e784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:59:28, skipping insertion in model container [2023-11-29 05:59:28,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:59:28" (3/3) ... [2023-11-29 05:59:28,014 INFO L112 eAbstractionObserver]: Analyzing ICFG sum02-2.c [2023-11-29 05:59:28,042 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:59:28,043 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:59:28,110 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:59:28,119 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@485ea2c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:59:28,119 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:59:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:59:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 05:59:28,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:59:28,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:59:28,133 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:59:28,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:59:28,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1260317837, now seen corresponding path program 1 times [2023-11-29 05:59:28,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:59:28,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530912401] [2023-11-29 05:59:28,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:59:28,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:59:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:28,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:59:28,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530912401] [2023-11-29 05:59:28,263 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-11-29 05:59:28,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048216] [2023-11-29 05:59:28,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:59:28,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:59:28,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:28,265 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:59:28,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:59:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:28,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 05:59:28,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:59:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:59:28,351 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:59:28,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:59:28,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:59:28,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:59:28,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473648433] [2023-11-29 05:59:28,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:59:28,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:59:28,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:59:28,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:59:28,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:59:28,392 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:59:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:59:28,414 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2023-11-29 05:59:28,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:59:28,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 05:59:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:59:28,423 INFO L225 Difference]: With dead ends: 18 [2023-11-29 05:59:28,423 INFO L226 Difference]: Without dead ends: 8 [2023-11-29 05:59:28,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:59:28,430 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:59:28,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:59:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-11-29 05:59:28,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-11-29 05:59:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:59:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-11-29 05:59:28,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2023-11-29 05:59:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:59:28,458 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-11-29 05:59:28,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:59:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-11-29 05:59:28,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 05:59:28,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:59:28,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:59:28,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:59:28,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-29 05:59:28,660 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:59:28,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:59:28,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1317397393, now seen corresponding path program 1 times [2023-11-29 05:59:28,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:59:28,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172159276] [2023-11-29 05:59:28,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:59:28,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:59:28,673 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 05:59:28,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129086675] [2023-11-29 05:59:28,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:59:28,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:59:28,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:28,675 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:59:28,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:59:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:28,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:59:28,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:59:28,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:59:28,741 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:59:28,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:59:28,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172159276] [2023-11-29 05:59:28,742 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 05:59:28,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129086675] [2023-11-29 05:59:28,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129086675] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:59:28,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:59:28,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:59:28,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046454449] [2023-11-29 05:59:28,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:59:28,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:59:28,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:59:28,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:59:28,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:59:28,745 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:59:28,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:59:28,756 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2023-11-29 05:59:28,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:59:28,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 05:59:28,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:59:28,757 INFO L225 Difference]: With dead ends: 13 [2023-11-29 05:59:28,757 INFO L226 Difference]: Without dead ends: 9 [2023-11-29 05:59:28,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:59:28,759 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:59:28,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:59:28,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-11-29 05:59:28,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-11-29 05:59:28,763 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) [2023-11-29 05:59:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2023-11-29 05:59:28,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2023-11-29 05:59:28,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:59:28,764 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2023-11-29 05:59:28,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:59:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2023-11-29 05:59:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 05:59:28,765 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:59:28,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:59:28,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:59:28,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:59:28,966 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:59:28,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:59:28,966 INFO L85 PathProgramCache]: Analyzing trace with hash -2087506997, now seen corresponding path program 1 times [2023-11-29 05:59:28,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:59:28,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558354338] [2023-11-29 05:59:28,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:59:28,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:59:28,980 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 05:59:28,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1874229790] [2023-11-29 05:59:28,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:59:28,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:59:28,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:28,982 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:59:28,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:59:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:29,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 05:59:29,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:59:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:59:29,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:59:29,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:59:29,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:59:29,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558354338] [2023-11-29 05:59:29,238 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 05:59:29,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874229790] [2023-11-29 05:59:29,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874229790] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:59:29,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:59:29,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-11-29 05:59:29,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127004479] [2023-11-29 05:59:29,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:59:29,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:59:29,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:59:29,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:59:29,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:59:29,242 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:59:29,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:59:29,307 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-11-29 05:59:29,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:59:29,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 05:59:29,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:59:29,309 INFO L225 Difference]: With dead ends: 14 [2023-11-29 05:59:29,309 INFO L226 Difference]: Without dead ends: 10 [2023-11-29 05:59:29,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:59:29,311 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:59:29,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 19 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:59:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-29 05:59:29,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-29 05:59:29,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:59:29,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2023-11-29 05:59:29,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2023-11-29 05:59:29,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:59:29,317 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2023-11-29 05:59:29,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:59:29,317 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2023-11-29 05:59:29,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 05:59:29,318 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:59:29,318 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:59:29,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:59:29,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:59:29,523 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:59:29,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:59:29,523 INFO L85 PathProgramCache]: Analyzing trace with hash -265360687, now seen corresponding path program 2 times [2023-11-29 05:59:29,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:59:29,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086209501] [2023-11-29 05:59:29,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:59:29,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:59:29,535 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 05:59:29,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [338593352] [2023-11-29 05:59:29,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:59:29,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:59:29,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:59:29,537 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:59:29,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:59:29,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:59:29,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:59:29,607 WARN L260 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 05:59:29,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:59:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:59:29,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:59:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:59:40,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:59:40,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086209501] [2023-11-29 05:59:40,066 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 05:59:40,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338593352] [2023-11-29 05:59:40,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338593352] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:59:40,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:59:40,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-11-29 05:59:40,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083678238] [2023-11-29 05:59:40,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:59:40,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 05:59:40,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:59:40,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 05:59:40,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=178, Unknown=2, NotChecked=0, Total=240 [2023-11-29 05:59:40,069 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:00:01,586 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] [2023-11-29 06:00:05,615 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse1 (mod (div (mod (+ (* .cse6 .cse6) .cse6) 18446744073709551616) 2) 18446744073709551616)) (.cse4 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse3 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (and (let ((.cse0 (mod |c_ULTIMATE.start_main_~sn~0#1| 18446744073709551616))) (or (= .cse0 0) (= .cse0 .cse1))) (let ((.cse2 (mod (+ .cse4 .cse3 |c_ULTIMATE.start_main_~sn~0#1|) 18446744073709551616))) (or (= .cse2 0) (forall ((v_z_4 Int)) (or (= (mod (div (mod (+ (* v_z_4 v_z_4) v_z_4) 18446744073709551616) 2) 18446744073709551616) .cse2) (< v_z_4 .cse3) (< v_z_4 .cse4) (< (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) (+ v_z_4 1)))))) (let ((.cse5 (mod (+ .cse3 |c_ULTIMATE.start_main_~sn~0#1|) 18446744073709551616))) (or (= .cse1 .cse5) (< .cse4 (+ .cse6 1)) (< .cse6 .cse3) (= .cse5 0)))))) is different from false [2023-11-29 06:00:29,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:00:29,678 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2023-11-29 06:00:29,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 06:00:29,679 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 06:00:29,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:00:29,679 INFO L225 Difference]: With dead ends: 22 [2023-11-29 06:00:29,679 INFO L226 Difference]: Without dead ends: 14 [2023-11-29 06:00:29,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 54.4s TimeCoverageRelationStatistics Valid=121, Invalid=335, Unknown=10, NotChecked=40, Total=506 [2023-11-29 06:00:29,681 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:00:29,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 16 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 1 Unknown, 14 Unchecked, 5.2s Time] [2023-11-29 06:00:29,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-29 06:00:29,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-29 06:00:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:00:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2023-11-29 06:00:29,690 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 9 [2023-11-29 06:00:29,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:00:29,691 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2023-11-29 06:00:29,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:00:29,691 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2023-11-29 06:00:29,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 06:00:29,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:00:29,692 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:00:29,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 06:00:29,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:00:29,893 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:00:29,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:00:29,893 INFO L85 PathProgramCache]: Analyzing trace with hash -687437487, now seen corresponding path program 3 times [2023-11-29 06:00:29,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:00:29,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584643853] [2023-11-29 06:00:29,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:00:29,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:00:29,918 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 06:00:29,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [695125249] [2023-11-29 06:00:29,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:00:29,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:00:29,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:00:29,920 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:00:29,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 06:00:30,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 06:00:30,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:00:30,169 WARN L260 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-29 06:00:30,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:00:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:00:30,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:01:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:01:36,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:01:36,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584643853] [2023-11-29 06:01:36,793 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 06:01:36,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695125249] [2023-11-29 06:01:36,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695125249] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:01:36,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:01:36,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-11-29 06:01:36,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121372776] [2023-11-29 06:01:36,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:01:36,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 06:01:36,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:01:36,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 06:01:36,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=429, Unknown=7, NotChecked=0, Total=552 [2023-11-29 06:01:36,796 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 24 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:01:40,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 06:01:42,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 06:01:46,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:01:47,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:01:51,968 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 [] [2023-11-29 06:01:57,698 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse0 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse11 (mod (+ 5 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse4 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4) 4294967296)) (.cse1 (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse9 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse5 (+ .cse0 1)) (.cse3 (mod (div (mod (+ (* .cse0 .cse0) .cse0) 18446744073709551616) 2) 18446744073709551616)) (.cse6 (< .cse0 .cse8)) (.cse7 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (and (let ((.cse2 (mod (+ .cse1 .cse7 .cse8 |c_ULTIMATE.start_main_~sn~0#1| .cse9) 18446744073709551616))) (or (< .cse0 .cse1) (= .cse2 0) (= .cse2 .cse3) (< .cse4 .cse5) .cse6)) (let ((.cse10 (mod (+ .cse1 .cse7 .cse8 |c_ULTIMATE.start_main_~sn~0#1| .cse4 .cse9) 18446744073709551616))) (or (forall ((v_z_10 Int)) (or (= .cse10 (mod (div (mod (+ (* v_z_10 v_z_10) v_z_10) 18446744073709551616) 2) 18446744073709551616)) (< v_z_10 .cse4) (< v_z_10 .cse8) (< .cse11 (+ v_z_10 1)))) (= .cse10 0))) (let ((.cse12 (mod (+ .cse11 .cse1 .cse7 .cse8 |c_ULTIMATE.start_main_~sn~0#1| .cse4 .cse9) 18446744073709551616))) (or (forall ((v_z_10 Int)) (or (= (mod (div (mod (+ (* v_z_10 v_z_10) v_z_10) 18446744073709551616) 2) 18446744073709551616) .cse12) (< v_z_10 .cse11) (< v_z_10 .cse7) (< (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) (+ v_z_10 1)))) (= 0 .cse12))) (let ((.cse13 (mod (+ .cse7 .cse8 |c_ULTIMATE.start_main_~sn~0#1| .cse9) 18446744073709551616))) (or (< .cse0 .cse9) (= .cse13 0) (< .cse1 .cse5) (= .cse3 .cse13) .cse6)) (let ((.cse14 (mod (+ .cse8 |c_ULTIMATE.start_main_~sn~0#1|) 18446744073709551616))) (or (= .cse3 .cse14) (< .cse7 .cse5) .cse6 (= .cse14 0))) (let ((.cse15 (mod |c_ULTIMATE.start_main_~sn~0#1| 18446744073709551616))) (or (= .cse15 0) (= .cse15 .cse3) (< .cse8 .cse5))) (let ((.cse16 (mod (+ .cse7 .cse8 |c_ULTIMATE.start_main_~sn~0#1|) 18446744073709551616))) (or (< .cse9 .cse5) (< .cse0 .cse7) (= .cse16 0) (= .cse3 .cse16) .cse6))))) is different from false [2023-11-29 06:03:06,714 WARN L293 SmtUtils]: Spent 23.08s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:03:10,756 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] [2023-11-29 06:03:14,766 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] [2023-11-29 06:03:24,603 WARN L293 SmtUtils]: Spent 9.05s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:03:28,610 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] [2023-11-29 06:03:33,232 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse2 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4) 4294967296)) (.cse3 (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse10 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse6 (+ .cse2 1)) (.cse1 (mod (div (mod (+ (* .cse2 .cse2) .cse2) 18446744073709551616) 2) 18446744073709551616)) (.cse7 (< .cse2 .cse9)) (.cse8 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (and (let ((.cse0 (mod |c_ULTIMATE.start_main_~sn~0#1| 18446744073709551616))) (or (= .cse0 0) (= .cse0 .cse1))) (let ((.cse4 (mod (+ .cse3 .cse8 .cse9 |c_ULTIMATE.start_main_~sn~0#1| .cse10) 18446744073709551616))) (or (< .cse2 .cse3) (= .cse4 0) (= .cse4 .cse1) (< .cse5 .cse6) .cse7)) (let ((.cse11 (mod (+ .cse3 .cse8 .cse9 |c_ULTIMATE.start_main_~sn~0#1| .cse5 .cse10) 18446744073709551616))) (or (forall ((v_z_10 Int)) (or (= .cse11 (mod (div (mod (+ (* v_z_10 v_z_10) v_z_10) 18446744073709551616) 2) 18446744073709551616)) (< v_z_10 .cse5) (< v_z_10 .cse9) (< (mod (+ 5 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) (+ v_z_10 1)))) (= .cse11 0))) (let ((.cse12 (mod (+ .cse8 .cse9 |c_ULTIMATE.start_main_~sn~0#1| .cse10) 18446744073709551616))) (or (< .cse2 .cse10) (= .cse12 0) (< .cse3 .cse6) (= .cse1 .cse12) .cse7)) (let ((.cse13 (mod (+ .cse9 |c_ULTIMATE.start_main_~sn~0#1|) 18446744073709551616))) (or (= .cse1 .cse13) (< .cse8 .cse6) .cse7 (= .cse13 0))) (let ((.cse14 (mod (+ .cse8 .cse9 |c_ULTIMATE.start_main_~sn~0#1|) 18446744073709551616))) (or (< .cse10 .cse6) (< .cse2 .cse8) (= .cse14 0) (= .cse1 .cse14) .cse7))))) is different from false [2023-11-29 06:03:34,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:03:38,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:03:40,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 06:03:42,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:04:52,685 WARN L293 SmtUtils]: Spent 58.30s on a formula simplification. DAG size of input: 59 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:05:00,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:06:35,819 WARN L293 SmtUtils]: Spent 1.45m on a formula simplification. DAG size of input: 61 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:06:46,276 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse0 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse1 (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse4 (+ .cse0 1)) (.cse3 (mod (div (mod (+ (* .cse0 .cse0) .cse0) 18446744073709551616) 2) 18446744073709551616)) (.cse5 (< .cse0 .cse7)) (.cse6 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (and (let ((.cse2 (mod (+ .cse1 .cse6 .cse7 |c_ULTIMATE.start_main_~sn~0#1| .cse8) 18446744073709551616))) (or (< .cse0 .cse1) (= .cse2 0) (= .cse2 .cse3) (< (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4) 4294967296) .cse4) .cse5)) (let ((.cse9 (mod (+ .cse6 .cse7 |c_ULTIMATE.start_main_~sn~0#1| .cse8) 18446744073709551616))) (or (< .cse0 .cse8) (= .cse9 0) (< .cse1 .cse4) (= .cse3 .cse9) .cse5)) (let ((.cse10 (mod (+ .cse7 |c_ULTIMATE.start_main_~sn~0#1|) 18446744073709551616))) (or (= .cse3 .cse10) (< .cse6 .cse4) .cse5 (= .cse10 0))) (let ((.cse11 (mod (+ .cse6 .cse7 |c_ULTIMATE.start_main_~sn~0#1|) 18446744073709551616))) (or (< .cse8 .cse4) (< .cse0 .cse6) (= .cse11 0) (= .cse3 .cse11) .cse5))))) is different from true [2023-11-29 06:06:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:46,279 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2023-11-29 06:06:46,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 06:06:46,279 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 06:06:46,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:46,280 INFO L225 Difference]: With dead ends: 32 [2023-11-29 06:06:46,280 INFO L226 Difference]: Without dead ends: 22 [2023-11-29 06:06:46,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 331.1s TimeCoverageRelationStatistics Valid=273, Invalid=840, Unknown=21, NotChecked=198, Total=1332 [2023-11-29 06:06:46,282 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 16 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 39.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:46,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 30 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 156 Invalid, 6 Unknown, 84 Unchecked, 39.1s Time] [2023-11-29 06:06:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-29 06:06:46,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-29 06:06:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2023-11-29 06:06:46,297 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 13 [2023-11-29 06:06:46,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:46,297 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2023-11-29 06:06:46,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:46,297 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2023-11-29 06:06:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 06:06:46,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:46,298 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:06:46,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 06:06:46,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:06:46,499 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:06:46,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:46,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1300494767, now seen corresponding path program 4 times [2023-11-29 06:06:46,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:06:46,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801148876] [2023-11-29 06:06:46,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:46,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:06:46,523 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 06:06:46,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1062624995] [2023-11-29 06:06:46,523 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 06:06:46,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:06:46,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:06:46,525 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:06:46,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54de2a8e-dfeb-4195-a5f7-ae48708d42df/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 06:06:46,782 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 06:06:46,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:06:46,784 WARN L260 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-29 06:06:46,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:47,126 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:06:47,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:08:29,060 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:09:30,828 WARN L293 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:10:33,670 WARN L293 SmtUtils]: Spent 6.90s on a formula simplification. DAG size of input: 63 DAG size of output: 62 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 06:11:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 102 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:11:44,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:11:44,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801148876] [2023-11-29 06:11:44,458 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 06:11:44,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062624995] [2023-11-29 06:11:44,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062624995] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:11:44,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:11:44,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2023-11-29 06:11:44,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216337641] [2023-11-29 06:11:44,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:11:44,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-29 06:11:44,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:11:44,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-29 06:11:44,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=1212, Unknown=24, NotChecked=0, Total=1560 [2023-11-29 06:11:44,461 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 40 states, 40 states have (on average 1.025) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:11:48,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:11:49,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 06:11:53,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 06:11:57,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 06:12:02,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 06:12:06,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 06:12:07,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:12:08,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 06:12:12,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-11-29 06:12:16,295 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 [] [2023-11-29 06:12:20,393 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 [] [2023-11-29 06:12:24,401 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 [] [2023-11-29 06:12:25,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 06:12:29,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 06:12:33,373 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 [] [2023-11-29 06:12:35,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 06:12:39,628 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 [] [2023-11-29 06:12:44,182 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse10 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse2 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 13) 4294967296)) (.cse24 (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse7 (mod (+ 5 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse8 (mod (+ 7 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse9 (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse12 (mod (+ 8 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse0 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 10) 4294967296)) (.cse3 (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse13 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4) 4294967296)) (.cse14 (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse25 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 11) 4294967296)) (.cse15 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse1 (+ .cse2 1)) (.cse31 (< .cse2 .cse10)) (.cse5 (mod (div (mod (+ (* .cse2 .cse2) .cse2) 18446744073709551616) 2) 18446744073709551616)) (.cse6 (< .cse2 .cse11))) (and (let ((.cse4 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 |c_ULTIMATE.start_main_~sn~0#1| .cse3 .cse13 .cse14 .cse15) 18446744073709551616))) (or (< .cse0 .cse1) (< .cse2 .cse3) (= .cse4 .cse5) .cse6 (= .cse4 0))) (let ((.cse16 (mod (+ .cse9 .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse15) 18446744073709551616))) (or (< .cse2 .cse9) (= .cse16 0) (= .cse16 .cse5) (< .cse13 .cse1) .cse6)) (let ((.cse17 (mod (+ .cse7 .cse9 .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse13 .cse14 .cse15) 18446744073709551616))) (or (= .cse17 .cse5) (< .cse8 .cse1) (= .cse17 0) (< .cse2 .cse14) .cse6)) (let ((.cse18 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse13 .cse14 .cse15) 18446744073709551616))) (or (< .cse2 .cse8) (= .cse18 0) (= .cse18 .cse5) .cse6 (< .cse12 .cse1))) (let ((.cse19 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 |c_ULTIMATE.start_main_~sn~0#1| .cse13 .cse14 .cse15) 18446744073709551616))) (or (= .cse19 .cse5) (< .cse2 .cse12) (< .cse3 .cse1) (= .cse19 0) .cse6)) (let ((.cse20 (mod (+ .cse9 .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse13 .cse15) 18446744073709551616))) (or (< .cse2 .cse13) (< .cse7 .cse1) (= .cse20 .cse5) .cse6 (= .cse20 0))) (let ((.cse21 (mod (+ .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse15) 18446744073709551616))) (or (< .cse2 .cse15) (= .cse21 0) (< .cse9 .cse1) (= .cse5 .cse21) .cse6)) (let ((.cse22 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 |c_ULTIMATE.start_main_~sn~0#1| .cse0 .cse24 .cse3 .cse13 .cse14 .cse25 .cse15) 18446744073709551616))) (or (= .cse22 0) (forall ((v_z_12 Int)) (or (< v_z_12 .cse11) (< .cse23 (+ v_z_12 1)) (< v_z_12 .cse24) (= (mod (div (mod (+ (* v_z_12 v_z_12) v_z_12) 18446744073709551616) 2) 18446744073709551616) .cse22))))) (let ((.cse26 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse23 .cse12 |c_ULTIMATE.start_main_~sn~0#1| .cse0 .cse24 .cse3 .cse13 .cse14 .cse25 .cse15) 18446744073709551616))) (or (= .cse26 0) (forall ((v_z_12 Int)) (or (= .cse26 (mod (div (mod (+ (* v_z_12 v_z_12) v_z_12) 18446744073709551616) 2) 18446744073709551616)) (< v_z_12 .cse10) (< (mod (+ 14 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) (+ v_z_12 1)) (< v_z_12 .cse23))))) (let ((.cse27 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 |c_ULTIMATE.start_main_~sn~0#1| .cse0 .cse3 .cse13 .cse14 .cse15) 18446744073709551616))) (or (= .cse27 0) (< .cse2 .cse0) (< .cse25 .cse1) (= .cse27 .cse5) .cse6)) (let ((.cse28 (mod (+ .cse11 |c_ULTIMATE.start_main_~sn~0#1|) 18446744073709551616))) (or (= .cse5 .cse28) (< .cse10 .cse1) .cse6 (= .cse28 0))) (let ((.cse29 (mod |c_ULTIMATE.start_main_~sn~0#1| 18446744073709551616))) (or (= .cse29 0) (= .cse29 .cse5) (< .cse11 .cse1))) (let ((.cse30 (mod (+ .cse7 .cse9 .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse13 .cse15) 18446744073709551616))) (or (< .cse2 .cse7) (= 0 .cse30) (= .cse5 .cse30) (< .cse14 .cse1) .cse6)) (let ((.cse32 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 |c_ULTIMATE.start_main_~sn~0#1| .cse0 .cse3 .cse13 .cse14 .cse25 .cse15) 18446744073709551616))) (or (< .cse24 .cse1) .cse31 (= .cse32 .cse5) (= .cse32 0) .cse6 (< .cse2 .cse25))) (let ((.cse33 (mod (+ .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1|) 18446744073709551616))) (or (< .cse15 .cse1) .cse31 (= .cse33 0) (= .cse5 .cse33) .cse6))))) is different from false [2023-11-29 06:12:48,192 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse11 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse10 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse2 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 13) 4294967296)) (.cse24 (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse7 (mod (+ 5 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse8 (mod (+ 7 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse9 (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse12 (mod (+ 8 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse0 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 10) 4294967296)) (.cse3 (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse13 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4) 4294967296)) (.cse14 (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse25 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 11) 4294967296)) (.cse15 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse1 (+ .cse2 1)) (.cse31 (< .cse2 .cse10)) (.cse5 (mod (div (mod (+ (* .cse2 .cse2) .cse2) 18446744073709551616) 2) 18446744073709551616)) (.cse6 (< .cse2 .cse11))) (and (let ((.cse4 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 |c_ULTIMATE.start_main_~sn~0#1| .cse3 .cse13 .cse14 .cse15) 18446744073709551616))) (or (< .cse0 .cse1) (< .cse2 .cse3) (= .cse4 .cse5) .cse6 (= .cse4 0))) (let ((.cse16 (mod (+ .cse9 .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse15) 18446744073709551616))) (or (< .cse2 .cse9) (= .cse16 0) (= .cse16 .cse5) (< .cse13 .cse1) .cse6)) (let ((.cse17 (mod (+ .cse7 .cse9 .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse13 .cse14 .cse15) 18446744073709551616))) (or (= .cse17 .cse5) (< .cse8 .cse1) (= .cse17 0) (< .cse2 .cse14) .cse6)) (let ((.cse18 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse13 .cse14 .cse15) 18446744073709551616))) (or (< .cse2 .cse8) (= .cse18 0) (= .cse18 .cse5) .cse6 (< .cse12 .cse1))) (let ((.cse19 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 |c_ULTIMATE.start_main_~sn~0#1| .cse13 .cse14 .cse15) 18446744073709551616))) (or (= .cse19 .cse5) (< .cse2 .cse12) (< .cse3 .cse1) (= .cse19 0) .cse6)) (let ((.cse20 (mod (+ .cse9 .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse13 .cse15) 18446744073709551616))) (or (< .cse2 .cse13) (< .cse7 .cse1) (= .cse20 .cse5) .cse6 (= .cse20 0))) (let ((.cse21 (mod (+ .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse15) 18446744073709551616))) (or (< .cse2 .cse15) (= .cse21 0) (< .cse9 .cse1) (= .cse5 .cse21) .cse6)) (let ((.cse22 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 |c_ULTIMATE.start_main_~sn~0#1| .cse0 .cse24 .cse3 .cse13 .cse14 .cse25 .cse15) 18446744073709551616))) (or (= .cse22 0) (forall ((v_z_12 Int)) (or (< v_z_12 .cse11) (< .cse23 (+ v_z_12 1)) (< v_z_12 .cse24) (= (mod (div (mod (+ (* v_z_12 v_z_12) v_z_12) 18446744073709551616) 2) 18446744073709551616) .cse22))))) (let ((.cse26 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse23 .cse12 |c_ULTIMATE.start_main_~sn~0#1| .cse0 .cse24 .cse3 .cse13 .cse14 .cse25 .cse15) 18446744073709551616))) (or (= .cse26 0) (forall ((v_z_12 Int)) (or (= .cse26 (mod (div (mod (+ (* v_z_12 v_z_12) v_z_12) 18446744073709551616) 2) 18446744073709551616)) (< v_z_12 .cse10) (< (mod (+ 14 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) (+ v_z_12 1)) (< v_z_12 .cse23))))) (let ((.cse27 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 |c_ULTIMATE.start_main_~sn~0#1| .cse0 .cse3 .cse13 .cse14 .cse15) 18446744073709551616))) (or (= .cse27 0) (< .cse2 .cse0) (< .cse25 .cse1) (= .cse27 .cse5) .cse6)) (let ((.cse28 (mod (+ .cse11 |c_ULTIMATE.start_main_~sn~0#1|) 18446744073709551616))) (or (= .cse5 .cse28) (< .cse10 .cse1) .cse6 (= .cse28 0))) (let ((.cse29 (mod |c_ULTIMATE.start_main_~sn~0#1| 18446744073709551616))) (or (= .cse29 0) (= .cse29 .cse5) (< .cse11 .cse1))) (let ((.cse30 (mod (+ .cse7 .cse9 .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse13 .cse15) 18446744073709551616))) (or (< .cse2 .cse7) (= 0 .cse30) (= .cse5 .cse30) (< .cse14 .cse1) .cse6)) (let ((.cse32 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 |c_ULTIMATE.start_main_~sn~0#1| .cse0 .cse3 .cse13 .cse14 .cse25 .cse15) 18446744073709551616))) (or (< .cse24 .cse1) .cse31 (= .cse32 .cse5) (= .cse32 0) .cse6 (< .cse2 .cse25))) (let ((.cse33 (mod (+ .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1|) 18446744073709551616))) (or (< .cse15 .cse1) .cse31 (= .cse33 0) (= .cse5 .cse33) .cse6))))) is different from true [2023-11-29 06:12:52,248 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse10 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse2 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296))) (let ((.cse23 (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse7 (mod (+ 5 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse8 (mod (+ 7 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse9 (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse12 (mod (+ 8 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse0 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 10) 4294967296)) (.cse3 (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse13 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 4) 4294967296)) (.cse14 (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse24 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 11) 4294967296)) (.cse15 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse1 (+ .cse2 1)) (.cse29 (< .cse2 .cse10)) (.cse5 (mod (div (mod (+ (* .cse2 .cse2) .cse2) 18446744073709551616) 2) 18446744073709551616)) (.cse6 (< .cse2 .cse11))) (and (let ((.cse4 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 |c_ULTIMATE.start_main_~sn~0#1| .cse3 .cse13 .cse14 .cse15) 18446744073709551616))) (or (< .cse0 .cse1) (< .cse2 .cse3) (= .cse4 .cse5) .cse6 (= .cse4 0))) (let ((.cse16 (mod (+ .cse9 .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse15) 18446744073709551616))) (or (< .cse2 .cse9) (= .cse16 0) (= .cse16 .cse5) (< .cse13 .cse1) .cse6)) (let ((.cse17 (mod (+ .cse7 .cse9 .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse13 .cse14 .cse15) 18446744073709551616))) (or (= .cse17 .cse5) (< .cse8 .cse1) (= .cse17 0) (< .cse2 .cse14) .cse6)) (let ((.cse18 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse13 .cse14 .cse15) 18446744073709551616))) (or (< .cse2 .cse8) (= .cse18 0) (= .cse18 .cse5) .cse6 (< .cse12 .cse1))) (let ((.cse19 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 |c_ULTIMATE.start_main_~sn~0#1| .cse13 .cse14 .cse15) 18446744073709551616))) (or (= .cse19 .cse5) (< .cse2 .cse12) (< .cse3 .cse1) (= .cse19 0) .cse6)) (let ((.cse20 (mod (+ .cse9 .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse13 .cse15) 18446744073709551616))) (or (< .cse2 .cse13) (< .cse7 .cse1) (= .cse20 .cse5) .cse6 (= .cse20 0))) (let ((.cse21 (mod (+ .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse15) 18446744073709551616))) (or (< .cse2 .cse15) (= .cse21 0) (< .cse9 .cse1) (= .cse5 .cse21) .cse6)) (let ((.cse22 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 |c_ULTIMATE.start_main_~sn~0#1| .cse0 .cse23 .cse3 .cse13 .cse14 .cse24 .cse15) 18446744073709551616))) (or (= .cse22 0) (forall ((v_z_12 Int)) (or (< v_z_12 .cse11) (< (mod (+ |c_ULTIMATE.start_main_~i~0#1| 13) 4294967296) (+ v_z_12 1)) (< v_z_12 .cse23) (= (mod (div (mod (+ (* v_z_12 v_z_12) v_z_12) 18446744073709551616) 2) 18446744073709551616) .cse22))))) (let ((.cse25 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 |c_ULTIMATE.start_main_~sn~0#1| .cse0 .cse3 .cse13 .cse14 .cse15) 18446744073709551616))) (or (= .cse25 0) (< .cse2 .cse0) (< .cse24 .cse1) (= .cse25 .cse5) .cse6)) (let ((.cse26 (mod (+ .cse11 |c_ULTIMATE.start_main_~sn~0#1|) 18446744073709551616))) (or (= .cse5 .cse26) (< .cse10 .cse1) .cse6 (= .cse26 0))) (let ((.cse27 (mod |c_ULTIMATE.start_main_~sn~0#1| 18446744073709551616))) (or (= .cse27 0) (= .cse27 .cse5) (< .cse11 .cse1))) (let ((.cse28 (mod (+ .cse7 .cse9 .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1| .cse13 .cse15) 18446744073709551616))) (or (< .cse2 .cse7) (= 0 .cse28) (= .cse5 .cse28) (< .cse14 .cse1) .cse6)) (let ((.cse30 (mod (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 |c_ULTIMATE.start_main_~sn~0#1| .cse0 .cse3 .cse13 .cse14 .cse24 .cse15) 18446744073709551616))) (or (< .cse23 .cse1) .cse29 (= .cse30 .cse5) (= .cse30 0) .cse6 (< .cse2 .cse24))) (let ((.cse31 (mod (+ .cse10 .cse11 |c_ULTIMATE.start_main_~sn~0#1|) 18446744073709551616))) (or (< .cse15 .cse1) .cse29 (= .cse31 0) (= .cse5 .cse31) .cse6))))) is different from false