./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-89.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 97e6e3d13746c4e22bbbdf0b6c24dfd54006258f6e92602d0c646bb6642564ab --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:25:22,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:25:22,236 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:25:22,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:25:22,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:25:22,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:25:22,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:25:22,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:25:22,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:25:22,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:25:22,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:25:22,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:25:22,307 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:25:22,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:25:22,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:25:22,310 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:25:22,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:25:22,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:25:22,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:25:22,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:25:22,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:25:22,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:25:22,314 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:25:22,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:25:22,315 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:25:22,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:25:22,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:25:22,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:25:22,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:25:22,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:25:22,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:25:22,320 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:25:22,320 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:25:22,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:25:22,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:25:22,321 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:25:22,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:25:22,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:25:22,321 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:25:22,322 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_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/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_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 97e6e3d13746c4e22bbbdf0b6c24dfd54006258f6e92602d0c646bb6642564ab [2023-11-06 22:25:22,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:25:22,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:25:22,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:25:22,734 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:25:22,735 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:25:22,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-89.i [2023-11-06 22:25:26,128 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:25:26,467 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:25:26,468 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-89.i [2023-11-06 22:25:26,487 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/data/177bd735b/d7db5219d93a49709a65345f0c3da343/FLAG03a69a4e8 [2023-11-06 22:25:26,508 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/data/177bd735b/d7db5219d93a49709a65345f0c3da343 [2023-11-06 22:25:26,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:25:26,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:25:26,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:25:26,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:25:26,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:25:26,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:26" (1/1) ... [2023-11-06 22:25:26,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360a82a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:26, skipping insertion in model container [2023-11-06 22:25:26,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:26" (1/1) ... [2023-11-06 22:25:26,582 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:25:26,756 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_59ee7d8e-eea2-4c51-bbba-ab227e058745/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-89.i[916,929] [2023-11-06 22:25:26,875 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:25:26,909 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:25:26,935 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_59ee7d8e-eea2-4c51-bbba-ab227e058745/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-89.i[916,929] [2023-11-06 22:25:26,978 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:25:26,998 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:25:26,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:26 WrapperNode [2023-11-06 22:25:26,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:25:27,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:25:27,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:25:27,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:25:27,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:26" (1/1) ... [2023-11-06 22:25:27,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:26" (1/1) ... [2023-11-06 22:25:27,090 INFO L138 Inliner]: procedures = 26, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 391 [2023-11-06 22:25:27,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:25:27,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:25:27,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:25:27,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:25:27,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:26" (1/1) ... [2023-11-06 22:25:27,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:26" (1/1) ... [2023-11-06 22:25:27,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:26" (1/1) ... [2023-11-06 22:25:27,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:26" (1/1) ... [2023-11-06 22:25:27,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:26" (1/1) ... [2023-11-06 22:25:27,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:26" (1/1) ... [2023-11-06 22:25:27,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:26" (1/1) ... [2023-11-06 22:25:27,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:26" (1/1) ... [2023-11-06 22:25:27,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:25:27,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:25:27,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:25:27,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:25:27,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:26" (1/1) ... [2023-11-06 22:25:27,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:25:27,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:27,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:25:27,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:25:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:25:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:25:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:25:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:25:27,250 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:25:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:25:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:25:27,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:25:27,375 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:25:27,377 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:25:28,013 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:25:28,034 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:25:28,034 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:25:28,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:28 BoogieIcfgContainer [2023-11-06 22:25:28,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:25:28,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:25:28,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:25:28,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:25:28,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:25:26" (1/3) ... [2023-11-06 22:25:28,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1633697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:28, skipping insertion in model container [2023-11-06 22:25:28,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:26" (2/3) ... [2023-11-06 22:25:28,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1633697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:28, skipping insertion in model container [2023-11-06 22:25:28,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:28" (3/3) ... [2023-11-06 22:25:28,053 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-89.i [2023-11-06 22:25:28,078 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:25:28,079 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:25:28,170 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:25:28,180 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=LoopsAndPotentialCycles, 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;@736a2868, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:25:28,181 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:25:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-06 22:25:28,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:25:28,216 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:28,217 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:28,218 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:28,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:28,232 INFO L85 PathProgramCache]: Analyzing trace with hash 983671971, now seen corresponding path program 1 times [2023-11-06 22:25:28,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:28,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42567213] [2023-11-06 22:25:28,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:28,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:28,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:28,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42567213] [2023-11-06 22:25:28,563 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-11-06 22:25:28,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706006962] [2023-11-06 22:25:28,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:28,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:28,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:28,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:28,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:25:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:28,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:25:28,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2023-11-06 22:25:28,905 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:25:28,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706006962] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:28,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:28,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:25:28,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009705270] [2023-11-06 22:25:28,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:28,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:25:28,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:28,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:25:29,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:25:29,006 INFO L87 Difference]: Start difference. First operand has 100 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 22:25:29,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:29,074 INFO L93 Difference]: Finished difference Result 193 states and 303 transitions. [2023-11-06 22:25:29,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:25:29,077 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2023-11-06 22:25:29,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:29,089 INFO L225 Difference]: With dead ends: 193 [2023-11-06 22:25:29,090 INFO L226 Difference]: Without dead ends: 96 [2023-11-06 22:25:29,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 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-06 22:25:29,101 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:29,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-06 22:25:29,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-06 22:25:29,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 81 states have internal predecessors, (113), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-06 22:25:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 139 transitions. [2023-11-06 22:25:29,152 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 139 transitions. Word has length 109 [2023-11-06 22:25:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:29,153 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 139 transitions. [2023-11-06 22:25:29,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 22:25:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 139 transitions. [2023-11-06 22:25:29,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:25:29,158 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:29,158 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:29,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:25:29,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-06 22:25:29,365 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:29,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:29,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1135548361, now seen corresponding path program 1 times [2023-11-06 22:25:29,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:29,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639089529] [2023-11-06 22:25:29,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:29,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:29,476 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:25:29,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [13453257] [2023-11-06 22:25:29,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:29,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:29,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:29,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:29,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:25:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:29,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:25:29,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:25:29,828 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:25:29,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:29,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639089529] [2023-11-06 22:25:29,831 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:25:29,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13453257] [2023-11-06 22:25:29,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13453257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:29,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:29,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:25:29,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097853265] [2023-11-06 22:25:29,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:29,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:25:29,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:29,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:25:29,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:25:29,839 INFO L87 Difference]: Start difference. First operand 96 states and 139 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:25:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:29,935 INFO L93 Difference]: Finished difference Result 201 states and 292 transitions. [2023-11-06 22:25:29,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:25:29,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2023-11-06 22:25:29,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:29,944 INFO L225 Difference]: With dead ends: 201 [2023-11-06 22:25:29,944 INFO L226 Difference]: Without dead ends: 108 [2023-11-06 22:25:29,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:25:29,947 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 21 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:29,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 404 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-06 22:25:29,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 98. [2023-11-06 22:25:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-06 22:25:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2023-11-06 22:25:29,967 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 109 [2023-11-06 22:25:29,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:29,969 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2023-11-06 22:25:29,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:25:29,969 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2023-11-06 22:25:29,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:25:29,972 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:29,972 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:29,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:25:30,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-06 22:25:30,179 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:30,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:30,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1815606731, now seen corresponding path program 1 times [2023-11-06 22:25:30,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:30,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764217727] [2023-11-06 22:25:30,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:30,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:30,267 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:25:30,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1606709740] [2023-11-06 22:25:30,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:30,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:30,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:30,282 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:30,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:25:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:30,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:25:30,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:25:30,567 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:25:30,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:30,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764217727] [2023-11-06 22:25:30,568 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:25:30,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606709740] [2023-11-06 22:25:30,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606709740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:30,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:30,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:25:30,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260649073] [2023-11-06 22:25:30,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:30,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:25:30,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:30,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:25:30,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:25:30,574 INFO L87 Difference]: Start difference. First operand 98 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:25:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:30,671 INFO L93 Difference]: Finished difference Result 201 states and 290 transitions. [2023-11-06 22:25:30,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:25:30,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2023-11-06 22:25:30,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:30,687 INFO L225 Difference]: With dead ends: 201 [2023-11-06 22:25:30,687 INFO L226 Difference]: Without dead ends: 106 [2023-11-06 22:25:30,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:25:30,690 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 12 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:30,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 402 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-06 22:25:30,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2023-11-06 22:25:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 85 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-06 22:25:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2023-11-06 22:25:30,714 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 109 [2023-11-06 22:25:30,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:30,715 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2023-11-06 22:25:30,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:25:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2023-11-06 22:25:30,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:25:30,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:30,721 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:30,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-06 22:25:30,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:30,928 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:30,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:30,929 INFO L85 PathProgramCache]: Analyzing trace with hash -704353203, now seen corresponding path program 1 times [2023-11-06 22:25:30,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:30,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062161127] [2023-11-06 22:25:30,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:30,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:30,979 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:25:30,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [748428083] [2023-11-06 22:25:30,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:30,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:30,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:30,982 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:31,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:25:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:31,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-06 22:25:31,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:31,613 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 22:25:31,871 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 22:25:32,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:25:32,096 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:25:32,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:25:32,334 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:25:32,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:25:32,527 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:25:32,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:25:32,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:25:32,890 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-06 22:25:32,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:25:32,950 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-06 22:25:32,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:25:32,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:25:32,974 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2023-11-06 22:25:33,096 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:25:33,097 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 26 [2023-11-06 22:25:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 220 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-11-06 22:25:33,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:25:33,434 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (and (forall ((v_ArrVal_171 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_172) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_171) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (mod (select .cse0 .cse1) 256) 0) (not (= (mod (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256) 0))))) (forall ((v_ArrVal_171 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_172) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_171) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (mod (select .cse2 |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256) 0) (= (mod (select .cse2 .cse1) 256) 1)))))) is different from false [2023-11-06 22:25:33,522 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base|)) (.cse1 (+ 4 |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (and (or (let ((.cse2 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse4 .cse1 1)))) (and (forall ((v_ArrVal_171 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse0 (select (store (store .cse2 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_172) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_171) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= (mod (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256) 0)) (= (mod (select .cse0 .cse1) 256) 0)))) (forall ((v_ArrVal_171 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse3 (select (store (store .cse2 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_172) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_171) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (mod (select .cse3 .cse1) 256) 1) (= (mod (select .cse3 |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256) 0)))))) (not |c_ULTIMATE.start_step_#t~short18#1|)) (or (let ((.cse6 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse4 .cse1 0)))) (and (forall ((v_ArrVal_171 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse5 (select (store (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_172) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_171) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= (mod (select .cse5 |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256) 0)) (= (mod (select .cse5 .cse1) 256) 0)))) (forall ((v_ArrVal_171 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse7 (select (store (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_172) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_171) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (mod (select .cse7 |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256) 0) (= (mod (select .cse7 .cse1) 256) 1)))))) |c_ULTIMATE.start_step_#t~short18#1|))) is different from false [2023-11-06 22:25:34,005 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (and (forall ((v_ArrVal_168 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_168) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= 0 (mod (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256)) (forall ((v_ArrVal_171 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse0 .cse2 1)) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_172) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_171) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (mod (select .cse1 .cse2) 256) 1) (= (mod (select .cse1 |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256) 0))))))) (forall ((v_ArrVal_168 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_168) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= 0 (mod (select .cse3 |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256))) (forall ((v_ArrVal_171 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse3 .cse2 0)) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_172) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_171) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (mod (select .cse4 .cse2) 256) 0) (not (= (mod (select .cse4 |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256) 0)))))))) (forall ((v_ArrVal_168 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_168) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (forall ((v_ArrVal_171 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse6 .cse2 1)) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_172) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_171) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (mod (select .cse5 .cse2) 256) 0) (not (= (mod (select .cse5 |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256) 0))))) (= 0 (mod (select .cse6 |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256))))) (forall ((v_ArrVal_168 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_168) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= 0 (mod (select .cse7 |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256))) (forall ((v_ArrVal_171 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse7 .cse2 0)) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_172) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_171) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (mod (select .cse8 .cse2) 256) 1) (= (mod (select .cse8 |c_~#BOOL_unsigned_char_Array_0~0.offset|) 256) 0))))))))) is different from false [2023-11-06 22:25:34,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:34,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062161127] [2023-11-06 22:25:34,488 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:25:34,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748428083] [2023-11-06 22:25:34,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748428083] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:25:34,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:25:34,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2023-11-06 22:25:34,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840202692] [2023-11-06 22:25:34,489 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-11-06 22:25:34,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 22:25:34,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:34,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:25:34,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=357, Unknown=4, NotChecked=120, Total=552 [2023-11-06 22:25:34,492 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 5 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-06 22:25:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:36,253 INFO L93 Difference]: Finished difference Result 295 states and 421 transitions. [2023-11-06 22:25:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:25:36,254 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 5 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 109 [2023-11-06 22:25:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:36,257 INFO L225 Difference]: With dead ends: 295 [2023-11-06 22:25:36,258 INFO L226 Difference]: Without dead ends: 198 [2023-11-06 22:25:36,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=223, Invalid=907, Unknown=4, NotChecked=198, Total=1332 [2023-11-06 22:25:36,261 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 595 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:36,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 762 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:25:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-11-06 22:25:36,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 121. [2023-11-06 22:25:36,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-06 22:25:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2023-11-06 22:25:36,286 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 109 [2023-11-06 22:25:36,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:36,287 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2023-11-06 22:25:36,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 5 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-06 22:25:36,288 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2023-11-06 22:25:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:25:36,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:36,292 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:36,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:25:36,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:36,502 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:36,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:36,502 INFO L85 PathProgramCache]: Analyzing trace with hash -382462684, now seen corresponding path program 1 times [2023-11-06 22:25:36,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:36,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92573879] [2023-11-06 22:25:36,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:36,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:36,571 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:25:36,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2010405409] [2023-11-06 22:25:36,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:36,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:36,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:36,575 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:36,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:25:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:36,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-06 22:25:36,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:37,356 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:25:37,579 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:25:37,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:25:37,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:25:37,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:25:37,687 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2023-11-06 22:25:37,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:25:37,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:25:37,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:25:37,799 INFO L322 Elim1Store]: treesize reduction 81, result has 18.2 percent of original size [2023-11-06 22:25:37,799 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 93 [2023-11-06 22:25:37,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:37,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92573879] [2023-11-06 22:25:37,917 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:25:37,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010405409] [2023-11-06 22:25:37,917 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-06 22:25:37,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:25:38,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:38,125 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-06 22:25:38,133 INFO L158 Benchmark]: Toolchain (without parser) took 11614.67ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 113.9MB in the beginning and 121.4MB in the end (delta: -7.6MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2023-11-06 22:25:38,133 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 144.7MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:25:38,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.37ms. Allocated memory is still 144.7MB. Free memory was 113.9MB in the beginning and 113.3MB in the end (delta: 538.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:25:38,134 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.52ms. Allocated memory is still 144.7MB. Free memory was 113.3MB in the beginning and 109.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:25:38,135 INFO L158 Benchmark]: Boogie Preprocessor took 62.52ms. Allocated memory is still 144.7MB. Free memory was 109.2MB in the beginning and 106.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:25:38,135 INFO L158 Benchmark]: RCFGBuilder took 881.60ms. Allocated memory is still 144.7MB. Free memory was 106.5MB in the beginning and 76.9MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-06 22:25:38,136 INFO L158 Benchmark]: TraceAbstraction took 10086.78ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 76.3MB in the beginning and 121.4MB in the end (delta: -45.2MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2023-11-06 22:25:38,138 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 144.7MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.37ms. Allocated memory is still 144.7MB. Free memory was 113.9MB in the beginning and 113.3MB in the end (delta: 538.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.52ms. Allocated memory is still 144.7MB. Free memory was 113.3MB in the beginning and 109.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.52ms. Allocated memory is still 144.7MB. Free memory was 109.2MB in the beginning and 106.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 881.60ms. Allocated memory is still 144.7MB. Free memory was 106.5MB in the beginning and 76.9MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10086.78ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 76.3MB in the beginning and 121.4MB in the end (delta: -45.2MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 22:25:38,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-89.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 97e6e3d13746c4e22bbbdf0b6c24dfd54006258f6e92602d0c646bb6642564ab --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:25:40,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:25:41,029 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:25:41,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:25:41,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:25:41,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:25:41,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:25:41,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:25:41,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:25:41,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:25:41,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:25:41,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:25:41,072 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:25:41,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:25:41,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:25:41,074 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:25:41,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:25:41,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:25:41,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:25:41,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:25:41,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:25:41,077 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:25:41,078 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:25:41,078 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:25:41,079 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:25:41,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:25:41,080 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:25:41,080 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:25:41,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:25:41,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:25:41,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:25:41,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:25:41,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:25:41,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:25:41,083 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:25:41,084 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:25:41,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:25:41,085 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:25:41,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:25:41,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:25:41,086 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:25:41,087 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:25:41,087 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_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/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_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 97e6e3d13746c4e22bbbdf0b6c24dfd54006258f6e92602d0c646bb6642564ab [2023-11-06 22:25:41,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:25:41,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:25:41,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:25:41,578 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:25:41,579 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:25:41,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-89.i [2023-11-06 22:25:44,943 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:25:45,223 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:25:45,224 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-89.i [2023-11-06 22:25:45,234 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/data/94c72efbd/ac3633fd1c39424dbb5037005d60ed91/FLAGe34be9acf [2023-11-06 22:25:45,251 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/data/94c72efbd/ac3633fd1c39424dbb5037005d60ed91 [2023-11-06 22:25:45,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:25:45,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:25:45,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:25:45,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:25:45,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:25:45,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:45" (1/1) ... [2023-11-06 22:25:45,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664f201e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:45, skipping insertion in model container [2023-11-06 22:25:45,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:45" (1/1) ... [2023-11-06 22:25:45,316 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:25:45,490 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_59ee7d8e-eea2-4c51-bbba-ab227e058745/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-89.i[916,929] [2023-11-06 22:25:45,560 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:25:45,579 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:25:45,594 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_59ee7d8e-eea2-4c51-bbba-ab227e058745/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-89.i[916,929] [2023-11-06 22:25:45,638 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:25:45,663 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:25:45,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:45 WrapperNode [2023-11-06 22:25:45,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:25:45,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:25:45,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:25:45,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:25:45,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:45" (1/1) ... [2023-11-06 22:25:45,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:45" (1/1) ... [2023-11-06 22:25:45,732 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 360 [2023-11-06 22:25:45,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:25:45,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:25:45,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:25:45,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:25:45,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:45" (1/1) ... [2023-11-06 22:25:45,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:45" (1/1) ... [2023-11-06 22:25:45,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:45" (1/1) ... [2023-11-06 22:25:45,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:45" (1/1) ... [2023-11-06 22:25:45,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:45" (1/1) ... [2023-11-06 22:25:45,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:45" (1/1) ... [2023-11-06 22:25:45,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:45" (1/1) ... [2023-11-06 22:25:45,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:45" (1/1) ... [2023-11-06 22:25:45,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:25:45,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:25:45,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:25:45,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:25:45,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:45" (1/1) ... [2023-11-06 22:25:45,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:25:45,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:45,864 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:25:45,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:25:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:25:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 22:25:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 22:25:45,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:25:45,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 22:25:45,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:25:45,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 22:25:45,931 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:25:45,931 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:25:45,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:25:45,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:25:45,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:25:45,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 22:25:45,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:25:46,062 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:25:46,070 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:25:46,903 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:25:46,912 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:25:46,912 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:25:46,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:46 BoogieIcfgContainer [2023-11-06 22:25:46,915 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:25:46,918 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:25:46,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:25:46,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:25:46,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:25:45" (1/3) ... [2023-11-06 22:25:46,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447a1754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:46, skipping insertion in model container [2023-11-06 22:25:46,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:45" (2/3) ... [2023-11-06 22:25:46,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447a1754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:46, skipping insertion in model container [2023-11-06 22:25:46,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:46" (3/3) ... [2023-11-06 22:25:46,926 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-89.i [2023-11-06 22:25:46,949 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:25:46,949 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:25:47,008 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:25:47,015 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=LoopsAndPotentialCycles, 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;@edf9493, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:25:47,016 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:25:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 79 states have internal predecessors, (110), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-06 22:25:47,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:25:47,041 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:47,042 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:47,043 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:47,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:47,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1982624221, now seen corresponding path program 1 times [2023-11-06 22:25:47,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:25:47,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816812847] [2023-11-06 22:25:47,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:47,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:25:47,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:25:47,084 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:25:47,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:25:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:47,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:25:47,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2023-11-06 22:25:47,600 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:25:47,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:25:47,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816812847] [2023-11-06 22:25:47,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816812847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:47,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:47,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:25:47,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204970816] [2023-11-06 22:25:47,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:47,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:25:47,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:25:47,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:25:47,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:25:47,659 INFO L87 Difference]: Start difference. First operand has 94 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 79 states have internal predecessors, (110), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 22:25:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:47,715 INFO L93 Difference]: Finished difference Result 181 states and 279 transitions. [2023-11-06 22:25:47,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:25:47,718 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2023-11-06 22:25:47,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:47,730 INFO L225 Difference]: With dead ends: 181 [2023-11-06 22:25:47,730 INFO L226 Difference]: Without dead ends: 90 [2023-11-06 22:25:47,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 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-06 22:25:47,742 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:47,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:47,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-06 22:25:47,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-11-06 22:25:47,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 75 states have internal predecessors, (103), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-06 22:25:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2023-11-06 22:25:47,795 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 109 [2023-11-06 22:25:47,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:47,796 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2023-11-06 22:25:47,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 22:25:47,796 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2023-11-06 22:25:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:25:47,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:47,799 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:47,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-06 22:25:48,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:25:48,000 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:48,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:48,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1830747831, now seen corresponding path program 1 times [2023-11-06 22:25:48,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:25:48,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533121198] [2023-11-06 22:25:48,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:48,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:25:48,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:25:48,006 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:25:48,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:25:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:48,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:25:48,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:25:48,381 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:25:48,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:25:48,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533121198] [2023-11-06 22:25:48,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533121198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:48,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:48,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:25:48,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065164868] [2023-11-06 22:25:48,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:48,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:25:48,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:25:48,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:25:48,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:25:48,387 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:25:48,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:48,540 INFO L93 Difference]: Finished difference Result 198 states and 285 transitions. [2023-11-06 22:25:48,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:25:48,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2023-11-06 22:25:48,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:48,548 INFO L225 Difference]: With dead ends: 198 [2023-11-06 22:25:48,548 INFO L226 Difference]: Without dead ends: 111 [2023-11-06 22:25:48,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:25:48,553 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 46 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:48,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 488 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:25:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-06 22:25:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 94. [2023-11-06 22:25:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 79 states have internal predecessors, (107), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-06 22:25:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2023-11-06 22:25:48,585 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 109 [2023-11-06 22:25:48,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:48,590 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2023-11-06 22:25:48,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:25:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2023-11-06 22:25:48,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:25:48,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:48,599 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:48,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:25:48,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:25:48,813 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:48,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:48,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1150689461, now seen corresponding path program 1 times [2023-11-06 22:25:48,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:25:48,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089220271] [2023-11-06 22:25:48,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:48,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:25:48,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:25:48,817 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:25:48,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:25:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:49,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:25:49,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:25:49,126 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:25:49,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:25:49,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089220271] [2023-11-06 22:25:49,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089220271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:49,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:49,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:25:49,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095467727] [2023-11-06 22:25:49,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:49,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:25:49,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:25:49,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:25:49,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:25:49,130 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:25:49,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:49,275 INFO L93 Difference]: Finished difference Result 205 states and 290 transitions. [2023-11-06 22:25:49,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:25:49,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2023-11-06 22:25:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:49,278 INFO L225 Difference]: With dead ends: 205 [2023-11-06 22:25:49,278 INFO L226 Difference]: Without dead ends: 114 [2023-11-06 22:25:49,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:25:49,281 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 49 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:49,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 603 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:25:49,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-06 22:25:49,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2023-11-06 22:25:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-06 22:25:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2023-11-06 22:25:49,295 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 109 [2023-11-06 22:25:49,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:49,296 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2023-11-06 22:25:49,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:25:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2023-11-06 22:25:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:25:49,299 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:49,299 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:49,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:25:49,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:25:49,509 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:49,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:49,510 INFO L85 PathProgramCache]: Analyzing trace with hash 624317901, now seen corresponding path program 1 times [2023-11-06 22:25:49,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:25:49,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238353440] [2023-11-06 22:25:49,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:49,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:25:49,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:25:49,518 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:25:49,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:25:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-06 22:25:50,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:50,292 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:25:50,857 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2023-11-06 22:25:51,594 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:25:51,595 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2023-11-06 22:25:52,392 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-11-06 22:25:53,088 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-11-06 22:25:53,671 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-11-06 22:25:54,475 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-11-06 22:25:54,720 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:25:54,720 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2023-11-06 22:25:54,851 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:25:54,852 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 67 [2023-11-06 22:25:54,861 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2023-11-06 22:25:55,167 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:25:55,168 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 37 [2023-11-06 22:25:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 65 proven. 202 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-06 22:25:55,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:25:55,760 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (and (forall ((v_ArrVal_92 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_91 (_ BitVec 32))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse2 |~#signed_long_int_Array_0~0.offset| v_ArrVal_91)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_92) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= ((_ extract 7 0) (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))))))) (forall ((v_ArrVal_92 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_91 (_ BitVec 32))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse2 |~#signed_long_int_Array_0~0.offset| v_ArrVal_91)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_92) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 .cse1)))) (= ((_ extract 7 0) (select .cse3 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))))))) is different from false [2023-11-06 22:25:55,942 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base|)) (.cse1 (bvadd (_ bv4 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (and (or (not |c_ULTIMATE.start_step_#t~short18#1|) (let ((.cse2 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse5 .cse1 ((_ sign_extend 24) (_ bv1 8)))))) (let ((.cse3 (select .cse2 |c_~#signed_long_int_Array_0~0.base|))) (and (forall ((v_ArrVal_92 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_91 (_ BitVec 32))) (let ((.cse0 (select (store (store .cse2 |c_~#signed_long_int_Array_0~0.base| (store .cse3 |~#signed_long_int_Array_0~0.offset| v_ArrVal_91)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_92) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) (_ bv1 32)) (= ((_ extract 7 0) (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))))) (forall ((v_ArrVal_92 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_91 (_ BitVec 32))) (let ((.cse4 (select (store (store .cse2 |c_~#signed_long_int_Array_0~0.base| (store .cse3 |~#signed_long_int_Array_0~0.offset| v_ArrVal_91)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_92) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= ((_ extract 7 0) (select .cse4 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse1))) (_ bv0 32))))))))) (or (let ((.cse7 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse5 .cse1 ((_ sign_extend 24) (_ bv0 8)))))) (let ((.cse8 (select .cse7 |c_~#signed_long_int_Array_0~0.base|))) (and (forall ((v_ArrVal_92 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_91 (_ BitVec 32))) (let ((.cse6 (select (store (store .cse7 |c_~#signed_long_int_Array_0~0.base| (store .cse8 |~#signed_long_int_Array_0~0.offset| v_ArrVal_91)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_92) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ extract 7 0) (select .cse6 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8)) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse6 .cse1))) (_ bv1 32))))) (forall ((v_ArrVal_92 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_91 (_ BitVec 32))) (let ((.cse9 (select (store (store .cse7 |c_~#signed_long_int_Array_0~0.base| (store .cse8 |~#signed_long_int_Array_0~0.offset| v_ArrVal_91)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_92) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= ((_ extract 7 0) (select .cse9 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse9 .cse1))) (_ bv0 32)))))))) |c_ULTIMATE.start_step_#t~short18#1|))) is different from false [2023-11-06 22:25:56,242 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse2 (bvadd (_ bv4 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse0 (= ((_ extract 7 0) (select .cse6 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8)))) (and (or .cse0 (let ((.cse3 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse6 .cse2 ((_ sign_extend 24) (_ bv1 8)))))) (let ((.cse4 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (and (forall ((v_ArrVal_92 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_91 (_ BitVec 32))) (let ((.cse1 (select (store (store .cse3 |c_~#signed_long_int_Array_0~0.base| (store .cse4 |~#signed_long_int_Array_0~0.offset| v_ArrVal_91)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_92) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse2))) (_ bv1 32)) (= ((_ extract 7 0) (select .cse1 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))))) (forall ((v_ArrVal_92 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_91 (_ BitVec 32))) (let ((.cse5 (select (store (store .cse3 |c_~#signed_long_int_Array_0~0.base| (store .cse4 |~#signed_long_int_Array_0~0.offset| v_ArrVal_91)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_92) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= ((_ extract 7 0) (select .cse5 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse5 .cse2))) (_ bv0 32))))))))) (or (let ((.cse8 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse6 .cse2 ((_ sign_extend 24) (_ bv0 8)))))) (let ((.cse9 (select .cse8 |c_~#signed_long_int_Array_0~0.base|))) (and (forall ((v_ArrVal_92 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_91 (_ BitVec 32))) (let ((.cse7 (select (store (store .cse8 |c_~#signed_long_int_Array_0~0.base| (store .cse9 |~#signed_long_int_Array_0~0.offset| v_ArrVal_91)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_92) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ extract 7 0) (select .cse7 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8)) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse7 .cse2))) (_ bv1 32))))) (forall ((v_ArrVal_92 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_91 (_ BitVec 32))) (let ((.cse10 (select (store (store .cse8 |c_~#signed_long_int_Array_0~0.base| (store .cse9 |~#signed_long_int_Array_0~0.offset| v_ArrVal_91)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_92) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= ((_ extract 7 0) (select .cse10 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse10 .cse2))) (_ bv0 32)))))))) (not .cse0))))) is different from false [2023-11-06 22:25:56,762 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ sign_extend 24) (_ bv1 8))) (.cse1 (bvadd (_ bv4 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse5 ((_ sign_extend 24) (_ bv0 8)))) (and (forall ((v_ArrVal_87 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_87))) (let ((.cse4 (select .cse3 |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (forall ((v_ArrVal_92 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_91 (_ BitVec 32))) (let ((.cse0 (select (store (let ((.cse2 (store .cse4 .cse1 .cse5))) (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| .cse2) |c_~#signed_long_int_Array_0~0.base| (store (select (store .cse3 |c_~#BOOL_unsigned_char_Array_0~0.base| .cse2) |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset| v_ArrVal_91))) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_92) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (_ bv0 8) ((_ extract 7 0) (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) (_ bv1 32))))) (not (= ((_ extract 7 0) (select .cse4 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))))))) (forall ((v_ArrVal_87 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_87))) (let ((.cse6 (select .cse9 |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ extract 7 0) (select .cse6 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8)) (forall ((v_ArrVal_92 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_91 (_ BitVec 32))) (let ((.cse7 (select (store (let ((.cse8 (store .cse6 .cse1 .cse10))) (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| .cse8) |c_~#signed_long_int_Array_0~0.base| (store (select (store .cse9 |c_~#BOOL_unsigned_char_Array_0~0.base| .cse8) |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset| v_ArrVal_91))) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_92) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse7 .cse1))) (_ bv0 32)) (not (= ((_ extract 7 0) (select .cse7 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8)))))))))) (forall ((v_ArrVal_87 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_87))) (let ((.cse14 (select .cse13 |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (forall ((v_ArrVal_92 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_91 (_ BitVec 32))) (let ((.cse11 (select (store (let ((.cse12 (store .cse14 .cse1 .cse10))) (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| .cse12) |c_~#signed_long_int_Array_0~0.base| (store (select (store .cse13 |c_~#BOOL_unsigned_char_Array_0~0.base| .cse12) |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset| v_ArrVal_91))) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_92) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ extract 7 0) (select .cse11 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8)) (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select .cse11 .cse1))))))) (= ((_ extract 7 0) (select .cse14 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8)))))) (forall ((v_ArrVal_87 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_87))) (let ((.cse18 (select .cse17 |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (forall ((v_ArrVal_92 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_91 (_ BitVec 32))) (let ((.cse15 (select (store (let ((.cse16 (store .cse18 .cse1 .cse5))) (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| .cse16) |c_~#signed_long_int_Array_0~0.base| (store (select (store .cse17 |c_~#BOOL_unsigned_char_Array_0~0.base| .cse16) |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset| v_ArrVal_91))) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_92) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select .cse15 |c_~#BOOL_unsigned_char_Array_0~0.offset|)))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse15 .cse1))) (_ bv0 32))))) (not (= ((_ extract 7 0) (select .cse18 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))))))))) is different from false [2023-11-06 22:25:57,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:25:57,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238353440] [2023-11-06 22:25:57,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238353440] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:25:57,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [191770379] [2023-11-06 22:25:58,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:58,000 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-06 22:25:58,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 [2023-11-06 22:25:58,008 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-06 22:25:58,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-11-06 22:25:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-06 22:25:58,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:58,976 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:25:59,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:25:59,685 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-06 22:26:00,201 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-06 22:26:00,581 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-06 22:26:00,991 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-06 22:26:01,466 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-06 22:26:01,705 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2023-11-06 22:26:01,902 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 40 [2023-11-06 22:26:02,301 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 44 [2023-11-06 22:26:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 64 proven. 184 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-06 22:26:02,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:26:02,556 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (and (forall ((v_ArrVal_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_124) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_125) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) (_ bv1 32)) (= ((_ extract 7 0) (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))))) (forall ((v_ArrVal_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_124) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_125) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= ((_ extract 7 0) (select .cse2 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 .cse1))) (_ bv0 32))))))) is different from false [2023-11-06 22:26:02,645 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base|)) (.cse1 (bvadd (_ bv4 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (and (or (let ((.cse2 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse4 .cse1 ((_ sign_extend 24) (_ bv1 8)))))) (and (forall ((v_ArrVal_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store (store .cse2 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_124) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_125) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) (_ bv1 32)) (= ((_ extract 7 0) (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))))) (forall ((v_ArrVal_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store (store .cse2 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_124) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_125) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 .cse1))) (_ bv0 32)) (not (= ((_ extract 7 0) (select .cse3 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8)))))))) (not |c_ULTIMATE.start_step_#t~short18#1|)) (or (let ((.cse6 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse4 .cse1 ((_ sign_extend 24) (_ bv0 8)))))) (and (forall ((v_ArrVal_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (store (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_124) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_125) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select .cse5 |c_~#BOOL_unsigned_char_Array_0~0.offset|)))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse5 .cse1))) (_ bv0 32))))) (forall ((v_ArrVal_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (store (store .cse6 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_124) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_125) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (_ bv0 8) ((_ extract 7 0) (select .cse7 |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse7 .cse1))) (_ bv1 32))))))) |c_ULTIMATE.start_step_#t~short18#1|))) is different from false [2023-11-06 22:26:02,765 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse1 (bvadd (_ bv4 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse5 (= ((_ extract 7 0) (select .cse4 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8)))) (and (or (let ((.cse2 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse4 .cse1 ((_ sign_extend 24) (_ bv1 8)))))) (and (forall ((v_ArrVal_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store (store .cse2 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_124) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_125) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) (_ bv1 32)) (= ((_ extract 7 0) (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))))) (forall ((v_ArrVal_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store (store .cse2 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_124) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_125) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 .cse1))) (_ bv0 32)) (not (= ((_ extract 7 0) (select .cse3 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8)))))))) .cse5) (or (let ((.cse7 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse4 .cse1 ((_ sign_extend 24) (_ bv0 8)))))) (and (forall ((v_ArrVal_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (store (store .cse7 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_124) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_125) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select .cse6 |c_~#BOOL_unsigned_char_Array_0~0.offset|)))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse6 .cse1))) (_ bv0 32))))) (forall ((v_ArrVal_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (store (store .cse7 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_124) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_125) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (_ bv0 8) ((_ extract 7 0) (select .cse8 |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse8 .cse1))) (_ bv1 32))))))) (not .cse5))))) is different from false [2023-11-06 22:26:02,990 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ sign_extend 24) (_ bv1 8))) (.cse2 (bvadd (_ bv4 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse3 ((_ sign_extend 24) (_ bv0 8)))) (and (forall ((v_ArrVal_121 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_121) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= ((_ extract 7 0) (select .cse0 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))) (forall ((v_ArrVal_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse0 .cse2 .cse3)) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_124) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_125) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (select .cse1 .cse2)))) (not (= (_ bv0 8) ((_ extract 7 0) (select .cse1 |c_~#BOOL_unsigned_char_Array_0~0.offset|)))))))))) (forall ((v_ArrVal_121 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_121) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (forall ((v_ArrVal_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse5 .cse2 .cse6)) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_124) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_125) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ extract 7 0) (select .cse4 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8)) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse2))) (_ bv1 32))))) (= ((_ extract 7 0) (select .cse5 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))))) (forall ((v_ArrVal_121 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_121) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (forall ((v_ArrVal_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse8 .cse2 .cse6)) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_124) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_125) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse7 .cse2))) (_ bv0 32)) (not (= ((_ extract 7 0) (select .cse7 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8)))))) (= ((_ extract 7 0) (select .cse8 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8))))) (forall ((v_ArrVal_121 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_121) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (forall ((v_ArrVal_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse10 .cse2 .cse3)) |c_~#signed_long_int_Array_0~0.base| v_ArrVal_124) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_125) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (select .cse9 .cse2)))) (= (_ bv0 8) ((_ extract 7 0) (select .cse9 |c_~#BOOL_unsigned_char_Array_0~0.offset|)))))) (not (= ((_ extract 7 0) (select .cse10 |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (_ bv0 8)))))))) is different from false [2023-11-06 22:26:03,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [191770379] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:03,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:26:03,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 26 [2023-11-06 22:26:03,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489107886] [2023-11-06 22:26:03,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:26:03,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-06 22:26:03,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:26:03,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-06 22:26:03,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=785, Unknown=8, NotChecked=504, Total=1406 [2023-11-06 22:26:03,397 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 27 states, 26 states have (on average 4.0) internal successors, (104), 25 states have internal predecessors, (104), 10 states have call successors, (26), 9 states have call predecessors, (26), 10 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2023-11-06 22:26:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:09,258 INFO L93 Difference]: Finished difference Result 280 states and 392 transitions. [2023-11-06 22:26:09,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:26:09,259 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.0) internal successors, (104), 25 states have internal predecessors, (104), 10 states have call successors, (26), 9 states have call predecessors, (26), 10 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 109 [2023-11-06 22:26:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:09,262 INFO L225 Difference]: With dead ends: 280 [2023-11-06 22:26:09,262 INFO L226 Difference]: Without dead ends: 187 [2023-11-06 22:26:09,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=391, Invalid=1795, Unknown=8, NotChecked=776, Total=2970 [2023-11-06 22:26:09,265 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 1281 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:09,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 764 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-11-06 22:26:09,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-11-06 22:26:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 114. [2023-11-06 22:26:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 98 states have internal predecessors, (134), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-06 22:26:09,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2023-11-06 22:26:09,290 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 109 [2023-11-06 22:26:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:09,291 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2023-11-06 22:26:09,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.0) internal successors, (104), 25 states have internal predecessors, (104), 10 states have call successors, (26), 9 states have call predecessors, (26), 10 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2023-11-06 22:26:09,292 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2023-11-06 22:26:09,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:26:09,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:09,294 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:09,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:09,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:09,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:26:09,702 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:09,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:09,702 INFO L85 PathProgramCache]: Analyzing trace with hash 946208420, now seen corresponding path program 1 times [2023-11-06 22:26:09,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:26:09,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28054025] [2023-11-06 22:26:09,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:09,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:26:09,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:26:09,705 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:26:09,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 22:26:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-06 22:26:10,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:10,229 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-06 22:26:10,611 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-06 22:26:10,972 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-06 22:26:11,304 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-06 22:26:11,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-11-06 22:26:12,103 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-11-06 22:26:13,200 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:26:13,201 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 50 [2023-11-06 22:26:14,392 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2023-11-06 22:26:15,184 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 86 [2023-11-06 22:26:15,194 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 91 [2023-11-06 22:26:15,212 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2023-11-06 22:26:15,434 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:26:16,320 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:26:16,321 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 54 [2023-11-06 22:26:16,836 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-11-06 22:26:16,836 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:26:16,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:26:16,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28054025] [2023-11-06 22:26:16,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28054025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:16,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:16,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 22:26:16,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940888623] [2023-11-06 22:26:16,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:16,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:26:16,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:26:16,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:26:16,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:26:16,839 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 22:26:34,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:34,007 INFO L93 Difference]: Finished difference Result 409 states and 566 transitions. [2023-11-06 22:26:34,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:26:34,008 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 109 [2023-11-06 22:26:34,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:34,011 INFO L225 Difference]: With dead ends: 409 [2023-11-06 22:26:34,011 INFO L226 Difference]: Without dead ends: 298 [2023-11-06 22:26:34,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2023-11-06 22:26:34,013 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 396 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:34,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 572 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2023-11-06 22:26:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-11-06 22:26:34,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 225. [2023-11-06 22:26:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 193 states have (on average 1.3626943005181347) internal successors, (263), 193 states have internal predecessors, (263), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 22:26:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 315 transitions. [2023-11-06 22:26:34,068 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 315 transitions. Word has length 109 [2023-11-06 22:26:34,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:34,069 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 315 transitions. [2023-11-06 22:26:34,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 22:26:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 315 transitions. [2023-11-06 22:26:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:26:34,072 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:34,072 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:34,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:34,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:26:34,290 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:34,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:34,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1785673378, now seen corresponding path program 1 times [2023-11-06 22:26:34,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:26:34,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786180452] [2023-11-06 22:26:34,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:34,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:26:34,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:26:34,292 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:26:34,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 22:26:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:34,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-06 22:26:34,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:35,053 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:26:35,646 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-11-06 22:26:35,979 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-11-06 22:26:36,312 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-11-06 22:26:36,754 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-11-06 22:26:36,833 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 26 [2023-11-06 22:26:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 68 proven. 196 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-06 22:26:36,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:26:36,938 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_183 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_183) |c_~#BOOL_unsigned_char_Array_0~0.base|) (bvadd (_ bv3 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)))))) is different from false [2023-11-06 22:26:36,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:26:36,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786180452] [2023-11-06 22:26:36,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786180452] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:36,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [132596871] [2023-11-06 22:26:36,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:36,974 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-06 22:26:36,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 [2023-11-06 22:26:36,976 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-06 22:26:37,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-11-06 22:26:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:37,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:26:37,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:37,469 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-11-06 22:26:37,857 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 22:26:38,116 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 22:26:38,419 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 22:26:38,704 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 22:26:39,007 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 22:26:39,073 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-11-06 22:26:39,079 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 63 proven. 193 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-06 22:26:39,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:26:39,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [132596871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:39,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:26:39,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 17 [2023-11-06 22:26:39,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50503232] [2023-11-06 22:26:39,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:26:39,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-06 22:26:39,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:26:39,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 22:26:39,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=275, Unknown=5, NotChecked=36, Total=420 [2023-11-06 22:26:39,219 INFO L87 Difference]: Start difference. First operand 225 states and 315 transitions. Second operand has 18 states, 16 states have (on average 5.25) internal successors, (84), 17 states have internal predecessors, (84), 9 states have call successors, (21), 7 states have call predecessors, (21), 9 states have return successors, (21), 7 states have call predecessors, (21), 9 states have call successors, (21) [2023-11-06 22:26:41,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:41,525 INFO L93 Difference]: Finished difference Result 471 states and 647 transitions. [2023-11-06 22:26:41,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:26:41,526 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.25) internal successors, (84), 17 states have internal predecessors, (84), 9 states have call successors, (21), 7 states have call predecessors, (21), 9 states have return successors, (21), 7 states have call predecessors, (21), 9 states have call successors, (21) Word has length 109 [2023-11-06 22:26:41,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:41,529 INFO L225 Difference]: With dead ends: 471 [2023-11-06 22:26:41,529 INFO L226 Difference]: Without dead ends: 249 [2023-11-06 22:26:41,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=212, Invalid=542, Unknown=6, NotChecked=52, Total=812 [2023-11-06 22:26:41,531 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 148 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:41,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 431 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-06 22:26:41,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-11-06 22:26:41,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 241. [2023-11-06 22:26:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 205 states have (on average 1.3317073170731708) internal successors, (273), 205 states have internal predecessors, (273), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 22:26:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 325 transitions. [2023-11-06 22:26:41,584 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 325 transitions. Word has length 109 [2023-11-06 22:26:41,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:41,585 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 325 transitions. [2023-11-06 22:26:41,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.25) internal successors, (84), 17 states have internal predecessors, (84), 9 states have call successors, (21), 7 states have call predecessors, (21), 9 states have return successors, (21), 7 states have call predecessors, (21), 9 states have call successors, (21) [2023-11-06 22:26:41,585 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 325 transitions. [2023-11-06 22:26:41,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:26:41,587 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:41,588 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:41,593 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2023-11-06 22:26:41,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:41,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:26:41,994 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:41,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:41,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1566818660, now seen corresponding path program 1 times [2023-11-06 22:26:41,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:26:41,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482867615] [2023-11-06 22:26:41,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:41,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:26:41,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:26:41,996 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:26:42,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 22:26:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:42,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-06 22:26:42,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:42,521 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-06 22:26:42,871 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-06 22:26:43,220 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-06 22:26:43,527 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-06 22:26:43,859 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-11-06 22:26:44,336 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-11-06 22:26:45,457 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:26:45,458 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 50 [2023-11-06 22:26:47,010 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2023-11-06 22:26:47,829 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 77 [2023-11-06 22:26:47,839 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 82 [2023-11-06 22:26:47,853 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:26:47,859 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 30 [2023-11-06 22:26:48,967 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:26:48,968 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 47 [2023-11-06 22:26:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-11-06 22:26:49,537 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:26:49,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:26:49,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482867615] [2023-11-06 22:26:49,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482867615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:49,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:49,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 22:26:49,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104311903] [2023-11-06 22:26:49,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:49,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:26:49,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:26:49,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:26:49,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:26:49,540 INFO L87 Difference]: Start difference. First operand 241 states and 325 transitions. Second operand has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 22:27:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:09,801 INFO L93 Difference]: Finished difference Result 558 states and 743 transitions. [2023-11-06 22:27:09,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:27:09,802 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 109 [2023-11-06 22:27:09,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:09,805 INFO L225 Difference]: With dead ends: 558 [2023-11-06 22:27:09,805 INFO L226 Difference]: Without dead ends: 320 [2023-11-06 22:27:09,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2023-11-06 22:27:09,807 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 322 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:09,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 634 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 15.1s Time] [2023-11-06 22:27:09,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-11-06 22:27:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 239. [2023-11-06 22:27:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 203 states have (on average 1.3251231527093597) internal successors, (269), 203 states have internal predecessors, (269), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 22:27:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 321 transitions. [2023-11-06 22:27:09,845 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 321 transitions. Word has length 109 [2023-11-06 22:27:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:09,846 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 321 transitions. [2023-11-06 22:27:09,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 22:27:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 321 transitions. [2023-11-06 22:27:09,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:27:09,848 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:09,848 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:09,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-06 22:27:10,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:10,063 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:10,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:10,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1888709179, now seen corresponding path program 1 times [2023-11-06 22:27:10,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:27:10,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7418341] [2023-11-06 22:27:10,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:10,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:10,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:27:10,066 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:27:10,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 22:27:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:10,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-06 22:27:10,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:10,755 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:27:11,493 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2023-11-06 22:27:12,062 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2023-11-06 22:27:12,549 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2023-11-06 22:27:13,039 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2023-11-06 22:27:13,704 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2023-11-06 22:27:13,882 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:27:13,882 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2023-11-06 22:27:14,009 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:27:14,010 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 61 [2023-11-06 22:27:14,015 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2023-11-06 22:27:14,293 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:27:14,294 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 38 [2023-11-06 22:27:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 58 proven. 208 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-06 22:27:14,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:27:14,999 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv2 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse1 (bvadd (_ bv4 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse3 (select |c_#memory_int| |c_~#signed_long_int_Array_0~0.base|))) (and (forall ((v_ArrVal_272 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse3 |~#signed_long_int_Array_0~0.offset| v_ArrVal_272)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_273) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) (_ bv0 32)) (not (= (_ bv0 8) ((_ extract 7 0) (select .cse0 .cse2))))))) (forall ((v_ArrVal_272 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| (store .cse3 |~#signed_long_int_Array_0~0.offset| v_ArrVal_272)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_273) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= (_ bv0 8) ((_ extract 7 0) (select .cse4 .cse2))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse1))) (_ bv1 32))))))) is different from false [2023-11-06 22:27:15,776 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base|)) (.cse1 (bvadd (_ bv2 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (let ((.cse7 (= ((_ extract 7 0) (select .cse6 .cse1)) (_ bv0 8))) (.cse2 (bvadd (_ bv4 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (and (or (let ((.cse3 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse6 .cse2 ((_ sign_extend 24) (_ bv0 8)))))) (let ((.cse4 (select .cse3 |c_~#signed_long_int_Array_0~0.base|))) (and (forall ((v_ArrVal_272 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse0 (select (store (store .cse3 |c_~#signed_long_int_Array_0~0.base| (store .cse4 |~#signed_long_int_Array_0~0.offset| v_ArrVal_272)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_273) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= ((_ extract 7 0) (select .cse0 .cse1)) (_ bv0 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse2))) (_ bv0 32))))) (forall ((v_ArrVal_272 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse5 (select (store (store .cse3 |c_~#signed_long_int_Array_0~0.base| (store .cse4 |~#signed_long_int_Array_0~0.offset| v_ArrVal_272)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_273) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse5 .cse2))) (_ bv1 32)) (= ((_ extract 7 0) (select .cse5 .cse1)) (_ bv0 8)))))))) (not .cse7)) (or .cse7 (let ((.cse9 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse6 .cse2 ((_ sign_extend 24) (_ bv1 8)))))) (let ((.cse10 (select .cse9 |c_~#signed_long_int_Array_0~0.base|))) (and (forall ((v_ArrVal_272 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse8 (select (store (store .cse9 |c_~#signed_long_int_Array_0~0.base| (store .cse10 |~#signed_long_int_Array_0~0.offset| v_ArrVal_272)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_273) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ extract 7 0) (select .cse8 .cse1)) (_ bv0 8)) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse8 .cse2))) (_ bv1 32))))) (forall ((v_ArrVal_272 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse11 (select (store (store .cse9 |c_~#signed_long_int_Array_0~0.base| (store .cse10 |~#signed_long_int_Array_0~0.offset| v_ArrVal_272)) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_273) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse11 .cse2))) (_ bv0 32)) (not (= ((_ extract 7 0) (select .cse11 .cse1)) (_ bv0 8))))))))))))) is different from false [2023-11-06 22:27:16,229 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ sign_extend 24) (_ bv1 8))) (.cse3 (bvadd (_ bv4 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse6 ((_ sign_extend 24) (_ bv0 8))) (.cse1 (bvadd (_ bv2 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (and (forall ((v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_268))) (let ((.cse0 (select .cse5 |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= ((_ extract 7 0) (select .cse0 .cse1)) (_ bv0 8))) (forall ((v_ArrVal_272 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse2 (select (store (let ((.cse4 (store .cse0 .cse3 .cse6))) (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| .cse4) |c_~#signed_long_int_Array_0~0.base| (store (select (store .cse5 |c_~#BOOL_unsigned_char_Array_0~0.base| .cse4) |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset| v_ArrVal_272))) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_273) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= ((_ extract 7 0) (select .cse2 .cse1)) (_ bv0 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse2 .cse3))) (_ bv0 32))))))))) (forall ((v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_268))) (let ((.cse7 (select .cse10 |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ extract 7 0) (select .cse7 .cse1)) (_ bv0 8)) (forall ((v_ArrVal_272 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse8 (select (store (let ((.cse9 (store .cse7 .cse3 .cse11))) (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| .cse9) |c_~#signed_long_int_Array_0~0.base| (store (select (store .cse10 |c_~#BOOL_unsigned_char_Array_0~0.base| .cse9) |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset| v_ArrVal_272))) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_273) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= ((_ extract 7 0) (select .cse8 .cse1)) (_ bv0 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse8 .cse3))) (_ bv0 32))))))))) (forall ((v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_268))) (let ((.cse15 (select .cse14 |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (forall ((v_ArrVal_272 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse12 (select (store (let ((.cse13 (store .cse15 .cse3 .cse11))) (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| .cse13) |c_~#signed_long_int_Array_0~0.base| (store (select (store .cse14 |c_~#BOOL_unsigned_char_Array_0~0.base| .cse13) |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset| v_ArrVal_272))) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_273) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ extract 7 0) (select .cse12 .cse1)) (_ bv0 8)) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse12 .cse3))) (_ bv1 32))))) (= ((_ extract 7 0) (select .cse15 .cse1)) (_ bv0 8)))))) (forall ((v_ArrVal_268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_268))) (let ((.cse19 (select .cse18 |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (forall ((v_ArrVal_272 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32))) (let ((.cse16 (select (store (let ((.cse17 (store .cse19 .cse3 .cse6))) (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| .cse17) |c_~#signed_long_int_Array_0~0.base| (store (select (store .cse18 |c_~#BOOL_unsigned_char_Array_0~0.base| .cse17) |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset| v_ArrVal_272))) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_273) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ extract 7 0) (select .cse16 .cse1)) (_ bv0 8)) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse16 .cse3))) (_ bv1 32))))) (not (= ((_ extract 7 0) (select .cse19 .cse1)) (_ bv0 8))))))))) is different from false [2023-11-06 22:27:17,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:27:17,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7418341] [2023-11-06 22:27:17,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7418341] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:27:17,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [870556731] [2023-11-06 22:27:17,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:17,410 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-06 22:27:17,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 [2023-11-06 22:27:17,412 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-06 22:27:17,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-11-06 22:27:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:18,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-06 22:27:18,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:18,584 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-06 22:27:19,064 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-06 22:27:19,562 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-06 22:27:19,993 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-06 22:27:20,472 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-06 22:27:21,032 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-06 22:27:21,288 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 38 [2023-11-06 22:27:21,587 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2023-11-06 22:27:22,220 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 54 [2023-11-06 22:27:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 80 proven. 184 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-06 22:27:22,410 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:27:22,583 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse1 (bvadd (_ bv2 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (and (forall ((v_ArrVal_302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_303) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_302) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ extract 7 0) (select .cse0 .cse1)) (_ bv0 8)) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse2))) (_ bv1 32))))) (forall ((v_ArrVal_302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#signed_long_int_Array_0~0.base| v_ArrVal_303) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_302) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse3 .cse2))) (_ bv0 32)) (not (= ((_ extract 7 0) (select .cse3 .cse1)) (_ bv0 8)))))))) is different from false [2023-11-06 22:27:23,438 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base|)) (.cse2 (bvadd (_ bv2 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (let ((.cse6 (= ((_ extract 7 0) (select .cse5 .cse2)) (_ bv0 8))) (.cse1 (bvadd (_ bv4 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (and (or (let ((.cse3 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse5 .cse1 ((_ sign_extend 24) (_ bv1 8)))))) (and (forall ((v_ArrVal_302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store (store .cse3 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_303) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_302) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse0 .cse1))) (_ bv1 32)) (= ((_ extract 7 0) (select .cse0 .cse2)) (_ bv0 8))))) (forall ((v_ArrVal_302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (store (store .cse3 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_303) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_302) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse4 .cse1))) (_ bv0 32)) (not (= ((_ extract 7 0) (select .cse4 .cse2)) (_ bv0 8)))))))) .cse6) (or (not .cse6) (let ((.cse8 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| (store .cse5 .cse1 ((_ sign_extend 24) (_ bv0 8)))))) (and (forall ((v_ArrVal_302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (store (store .cse8 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_303) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_302) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (= ((_ extract 7 0) (select .cse7 .cse2)) (_ bv0 8)) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse7 .cse1))) (_ bv1 32))))) (forall ((v_ArrVal_302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (store (store .cse8 |c_~#signed_long_int_Array_0~0.base| v_ArrVal_303) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_302) |c_~#BOOL_unsigned_char_Array_0~0.base|))) (or (not (= ((_ extract 7 0) (select .cse9 .cse2)) (_ bv0 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (select .cse9 .cse1))) (_ bv0 32))))))))))) is different from false [2023-11-06 22:27:24,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [870556731] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:27:24,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:27:24,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 30 [2023-11-06 22:27:24,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572914050] [2023-11-06 22:27:24,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:27:24,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-06 22:27:24,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:27:24,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-06 22:27:24,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1171, Unknown=28, NotChecked=370, Total=1722 [2023-11-06 22:27:24,810 INFO L87 Difference]: Start difference. First operand 239 states and 321 transitions. Second operand has 31 states, 29 states have (on average 3.689655172413793) internal successors, (107), 28 states have internal predecessors, (107), 11 states have call successors, (26), 10 states have call predecessors, (26), 11 states have return successors, (26), 11 states have call predecessors, (26), 11 states have call successors, (26) [2023-11-06 22:27:32,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:32,896 INFO L93 Difference]: Finished difference Result 687 states and 915 transitions. [2023-11-06 22:27:32,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-06 22:27:32,901 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 3.689655172413793) internal successors, (107), 28 states have internal predecessors, (107), 11 states have call successors, (26), 10 states have call predecessors, (26), 11 states have return successors, (26), 11 states have call predecessors, (26), 11 states have call successors, (26) Word has length 109 [2023-11-06 22:27:32,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:32,905 INFO L225 Difference]: With dead ends: 687 [2023-11-06 22:27:32,905 INFO L226 Difference]: Without dead ends: 451 [2023-11-06 22:27:32,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=667, Invalid=3107, Unknown=28, NotChecked=620, Total=4422 [2023-11-06 22:27:32,909 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 1055 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:32,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 1092 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1824 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2023-11-06 22:27:32,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2023-11-06 22:27:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 258. [2023-11-06 22:27:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 218 states have (on average 1.3073394495412844) internal successors, (285), 218 states have internal predecessors, (285), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 22:27:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 337 transitions. [2023-11-06 22:27:32,963 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 337 transitions. Word has length 109 [2023-11-06 22:27:32,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:32,963 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 337 transitions. [2023-11-06 22:27:32,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 3.689655172413793) internal successors, (107), 28 states have internal predecessors, (107), 11 states have call successors, (26), 10 states have call predecessors, (26), 11 states have return successors, (26), 11 states have call predecessors, (26), 11 states have call successors, (26) [2023-11-06 22:27:32,964 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 337 transitions. [2023-11-06 22:27:32,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:27:32,966 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:32,966 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:32,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:33,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:33,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt [2023-11-06 22:27:33,377 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:33,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:33,377 INFO L85 PathProgramCache]: Analyzing trace with hash 867640825, now seen corresponding path program 1 times [2023-11-06 22:27:33,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:27:33,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573670065] [2023-11-06 22:27:33,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:33,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:33,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:27:33,379 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:27:33,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-06 22:27:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:33,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 22:27:33,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:34,395 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 22:27:35,228 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-11-06 22:27:35,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-11-06 22:27:36,016 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-11-06 22:27:36,544 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-11-06 22:27:36,612 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2023-11-06 22:27:36,640 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2023-11-06 22:27:36,645 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-11-06 22:27:36,739 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 26 [2023-11-06 22:27:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 68 proven. 196 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-06 22:27:36,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:27:37,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:27:37,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573670065] [2023-11-06 22:27:37,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573670065] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:27:37,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [528059752] [2023-11-06 22:27:37,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:37,543 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-06 22:27:37,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 [2023-11-06 22:27:37,544 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-06 22:27:37,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-11-06 22:27:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:38,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 22:27:38,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:38,973 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:27:39,290 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:27:39,584 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:27:39,916 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:27:40,241 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:27:40,454 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:27:40,472 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-11-06 22:27:40,577 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-11-06 22:27:40,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:27:41,043 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_334 (_ BitVec 32)) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_330 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_360))) (let ((.cse0 (select .cse3 |c_~#BOOL_unsigned_char_Array_0~0.base|)) (.cse1 (bvadd (_ bv3 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))) (or (= ((_ extract 7 0) (select .cse0 .cse1)) (_ bv0 8)) (not (= ((_ extract 7 0) (select (select (store (let ((.cse2 (store .cse0 (bvadd (_ bv4 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|) v_ArrVal_330))) (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| .cse2) |c_~#signed_long_int_Array_0~0.base| (store (select (store .cse3 |c_~#BOOL_unsigned_char_Array_0~0.base| .cse2) |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset| v_ArrVal_334))) |c_~#unsigned_short_int_Array_0~0.base| v_ArrVal_332) |c_~#BOOL_unsigned_char_Array_0~0.base|) .cse1)) (_ bv0 8))))))) is different from false [2023-11-06 22:27:41,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [528059752] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:27:41,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:27:41,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2023-11-06 22:27:41,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573048615] [2023-11-06 22:27:41,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:27:41,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 22:27:41,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:27:41,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 22:27:41,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=505, Unknown=13, NotChecked=48, Total=702 [2023-11-06 22:27:41,193 INFO L87 Difference]: Start difference. First operand 258 states and 337 transitions. Second operand has 21 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 19 states have internal predecessors, (99), 9 states have call successors, (26), 8 states have call predecessors, (26), 9 states have return successors, (26), 8 states have call predecessors, (26), 9 states have call successors, (26) [2023-11-06 22:27:44,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:44,100 INFO L93 Difference]: Finished difference Result 540 states and 698 transitions. [2023-11-06 22:27:44,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:27:44,101 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 19 states have internal predecessors, (99), 9 states have call successors, (26), 8 states have call predecessors, (26), 9 states have return successors, (26), 8 states have call predecessors, (26), 9 states have call successors, (26) Word has length 109 [2023-11-06 22:27:44,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:44,104 INFO L225 Difference]: With dead ends: 540 [2023-11-06 22:27:44,104 INFO L226 Difference]: Without dead ends: 285 [2023-11-06 22:27:44,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 245 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=420, Invalid=1293, Unknown=13, NotChecked=80, Total=1806 [2023-11-06 22:27:44,106 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 656 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:44,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 445 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-06 22:27:44,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-11-06 22:27:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 253. [2023-11-06 22:27:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 213 states have (on average 1.295774647887324) internal successors, (276), 213 states have internal predecessors, (276), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 22:27:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 328 transitions. [2023-11-06 22:27:44,153 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 328 transitions. Word has length 109 [2023-11-06 22:27:44,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:44,154 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 328 transitions. [2023-11-06 22:27:44,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 19 states have internal predecessors, (99), 9 states have call successors, (26), 8 states have call predecessors, (26), 9 states have return successors, (26), 8 states have call predecessors, (26), 9 states have call successors, (26) [2023-11-06 22:27:44,155 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 328 transitions. [2023-11-06 22:27:44,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-06 22:27:44,156 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:44,157 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:44,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2023-11-06 22:27:44,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:44,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:44,563 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:44,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:44,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1654255937, now seen corresponding path program 1 times [2023-11-06 22:27:44,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:27:44,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452000533] [2023-11-06 22:27:44,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:44,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:44,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:27:44,565 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:27:44,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-06 22:27:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:44,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:27:44,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:27:44,803 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:27:44,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:27:44,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452000533] [2023-11-06 22:27:44,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452000533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:44,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:44,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:27:44,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702412094] [2023-11-06 22:27:44,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:44,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:27:44,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:27:44,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:27:44,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:27:44,808 INFO L87 Difference]: Start difference. First operand 253 states and 328 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:27:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:44,937 INFO L93 Difference]: Finished difference Result 549 states and 719 transitions. [2023-11-06 22:27:44,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:27:44,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 111 [2023-11-06 22:27:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:44,942 INFO L225 Difference]: With dead ends: 549 [2023-11-06 22:27:44,943 INFO L226 Difference]: Without dead ends: 299 [2023-11-06 22:27:44,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:27:44,945 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 95 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:44,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 475 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:27:44,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-06 22:27:45,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 259. [2023-11-06 22:27:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 219 states have (on average 1.2876712328767124) internal successors, (282), 219 states have internal predecessors, (282), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 22:27:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 334 transitions. [2023-11-06 22:27:45,007 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 334 transitions. Word has length 111 [2023-11-06 22:27:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:45,008 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 334 transitions. [2023-11-06 22:27:45,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:27:45,009 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 334 transitions. [2023-11-06 22:27:45,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-06 22:27:45,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:45,011 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:45,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:45,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:45,214 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:45,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:45,215 INFO L85 PathProgramCache]: Analyzing trace with hash -982658881, now seen corresponding path program 1 times [2023-11-06 22:27:45,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:27:45,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150072279] [2023-11-06 22:27:45,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:45,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:45,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:27:45,216 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:27:45,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-06 22:27:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:45,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:27:45,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:45,475 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:27:45,476 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 17 [2023-11-06 22:27:45,927 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:27:45,928 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:27:45,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:27:45,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150072279] [2023-11-06 22:27:45,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150072279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:45,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:45,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:27:45,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338790074] [2023-11-06 22:27:45,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:45,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:27:45,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:27:45,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:27:45,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:27:45,930 INFO L87 Difference]: Start difference. First operand 259 states and 334 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:27:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:46,585 INFO L93 Difference]: Finished difference Result 635 states and 817 transitions. [2023-11-06 22:27:46,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:27:46,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 111 [2023-11-06 22:27:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:46,589 INFO L225 Difference]: With dead ends: 635 [2023-11-06 22:27:46,589 INFO L226 Difference]: Without dead ends: 379 [2023-11-06 22:27:46,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:27:46,591 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 96 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:46,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 398 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:27:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-11-06 22:27:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 350. [2023-11-06 22:27:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 290 states have (on average 1.2689655172413794) internal successors, (368), 290 states have internal predecessors, (368), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-06 22:27:46,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 446 transitions. [2023-11-06 22:27:46,695 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 446 transitions. Word has length 111 [2023-11-06 22:27:46,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:46,696 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 446 transitions. [2023-11-06 22:27:46,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:27:46,696 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 446 transitions. [2023-11-06 22:27:46,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-06 22:27:46,697 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:46,698 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:46,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:46,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:46,913 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:46,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:46,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1106229742, now seen corresponding path program 1 times [2023-11-06 22:27:46,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:27:46,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511241598] [2023-11-06 22:27:46,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:46,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:46,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:27:46,915 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:27:46,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-06 22:27:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:47,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-06 22:27:47,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:47,527 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-06 22:27:47,873 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-06 22:27:48,219 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-06 22:27:48,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-06 22:27:49,038 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:27:49,038 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2023-11-06 22:27:49,449 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-06 22:27:50,077 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:27:50,077 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-11-06 22:27:50,241 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2023-11-06 22:27:50,323 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2023-11-06 22:27:50,330 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2023-11-06 22:27:50,344 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2023-11-06 22:27:50,354 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:27:50,833 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:27:50,833 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 38 [2023-11-06 22:27:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 96 proven. 120 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-11-06 22:27:50,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:27:56,270 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_437 (_ BitVec 32)) (v_ArrVal_436 (_ BitVec 32)) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_435))) (store .cse2 |c_~#signed_long_int_Array_0~0.base| (store (select .cse2 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset| v_ArrVal_437))))) (let ((.cse1 (select .cse0 |c_~#unsigned_short_int_Array_0~0.base|))) (= ((_ zero_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select (store .cse0 |c_~#unsigned_short_int_Array_0~0.base| (store .cse1 (bvadd (_ bv2 32) |c_~#unsigned_short_int_Array_0~0.offset|) v_ArrVal_436)) |c_~#signed_char_Array_0~0.base|) (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|))))) ((_ zero_extend 16) ((_ extract 15 0) (select .cse1 |c_~#unsigned_short_int_Array_0~0.offset|))))))) is different from false [2023-11-06 22:27:56,363 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_437 (_ BitVec 32)) (v_ArrVal_436 (_ BitVec 32)) (|~#unsigned_short_int_Array_0~0.offset| (_ BitVec 32)) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_435 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset| ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|) .cse2)))))) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_435))) (let ((.cse0 (store (select .cse3 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset| v_ArrVal_437))) (let ((.cse1 (select (store .cse3 |c_~#signed_long_int_Array_0~0.base| .cse0) |c_~#unsigned_short_int_Array_0~0.base|))) (= ((_ zero_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select (store (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_435) |c_~#signed_long_int_Array_0~0.base| .cse0) |c_~#unsigned_short_int_Array_0~0.base| (store .cse1 (bvadd |~#unsigned_short_int_Array_0~0.offset| (_ bv2 32)) v_ArrVal_436)) |c_~#signed_char_Array_0~0.base|) .cse2)))) ((_ zero_extend 16) ((_ extract 15 0) (select .cse1 |~#unsigned_short_int_Array_0~0.offset|))))))))) is different from false [2023-11-06 22:27:56,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:27:56,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511241598] [2023-11-06 22:27:56,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511241598] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:27:56,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1691627126] [2023-11-06 22:27:56,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:56,568 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-06 22:27:56,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 [2023-11-06 22:27:56,569 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-06 22:27:56,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-11-06 22:27:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:58,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-06 22:27:58,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:58,428 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-06 22:27:59,063 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-06 22:27:59,595 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-06 22:28:00,124 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-06 22:28:00,656 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-06 22:28:01,149 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-06 22:28:02,006 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-11-06 22:28:02,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-11-06 22:28:02,428 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-11-06 22:28:02,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2023-11-06 22:28:03,058 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2023-11-06 22:28:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-11-06 22:28:03,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:28:03,952 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_437 (_ BitVec 32)) (v_ArrVal_436 (_ BitVec 32)) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_469))) (store .cse2 |c_~#signed_long_int_Array_0~0.base| (store (select .cse2 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset| v_ArrVal_437))))) (let ((.cse1 (select .cse0 |c_~#unsigned_short_int_Array_0~0.base|))) (= ((_ zero_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select (store .cse0 |c_~#unsigned_short_int_Array_0~0.base| (store .cse1 (bvadd (_ bv2 32) |c_~#unsigned_short_int_Array_0~0.offset|) v_ArrVal_436)) |c_~#signed_char_Array_0~0.base|) (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|))))) ((_ zero_extend 16) ((_ extract 15 0) (select .cse1 |c_~#unsigned_short_int_Array_0~0.offset|))))))) is different from false [2023-11-06 22:28:04,034 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_437 (_ BitVec 32)) (v_ArrVal_436 (_ BitVec 32)) (|~#signed_long_int_Array_0~0.offset| (_ BitVec 32)) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv1 32) |c_~#signed_char_Array_0~0.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base| (store (select |c_#memory_int| |c_~#unsigned_short_int_Array_0~0.base|) |c_~#unsigned_short_int_Array_0~0.offset| ((_ sign_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select |c_#memory_int| |c_~#signed_char_Array_0~0.base|) .cse2)))))) |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_469))) (let ((.cse1 (store (select .cse3 |c_~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset| v_ArrVal_437))) (let ((.cse0 (select (store .cse3 |c_~#signed_long_int_Array_0~0.base| .cse1) |c_~#unsigned_short_int_Array_0~0.base|))) (= ((_ zero_extend 16) ((_ extract 15 0) (select .cse0 |c_~#unsigned_short_int_Array_0~0.offset|))) ((_ zero_extend 16) ((_ sign_extend 8) ((_ extract 7 0) (select (select (store (store (store |c_#memory_int| |c_~#BOOL_unsigned_char_Array_0~0.base| v_ArrVal_469) |c_~#signed_long_int_Array_0~0.base| .cse1) |c_~#unsigned_short_int_Array_0~0.base| (store .cse0 (bvadd (_ bv2 32) |c_~#unsigned_short_int_Array_0~0.offset|) v_ArrVal_436)) |c_~#signed_char_Array_0~0.base|) .cse2)))))))))) is different from false [2023-11-06 22:28:04,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1691627126] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:28:04,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:28:04,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-11-06 22:28:04,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780132698] [2023-11-06 22:28:04,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:28:04,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 22:28:04,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:04,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:28:04,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=220, Unknown=6, NotChecked=132, Total=420 [2023-11-06 22:28:04,267 INFO L87 Difference]: Start difference. First operand 350 states and 446 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 14 states have internal predecessors, (105), 5 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2023-11-06 22:28:07,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:07,807 INFO L93 Difference]: Finished difference Result 613 states and 785 transitions. [2023-11-06 22:28:07,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:28:07,808 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 14 states have internal predecessors, (105), 5 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 113 [2023-11-06 22:28:07,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:07,811 INFO L225 Difference]: With dead ends: 613 [2023-11-06 22:28:07,811 INFO L226 Difference]: Without dead ends: 357 [2023-11-06 22:28:07,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=123, Invalid=307, Unknown=6, NotChecked=164, Total=600 [2023-11-06 22:28:07,813 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 474 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:07,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 724 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-06 22:28:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2023-11-06 22:28:07,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 352. [2023-11-06 22:28:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 292 states have (on average 1.2671232876712328) internal successors, (370), 292 states have internal predecessors, (370), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-06 22:28:07,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 448 transitions. [2023-11-06 22:28:07,925 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 448 transitions. Word has length 113 [2023-11-06 22:28:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:07,926 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 448 transitions. [2023-11-06 22:28:07,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 14 states have internal predecessors, (105), 5 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2023-11-06 22:28:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 448 transitions. [2023-11-06 22:28:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-06 22:28:07,928 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:07,928 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:07,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:08,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:08,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:28:08,342 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:08,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:08,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1108076784, now seen corresponding path program 1 times [2023-11-06 22:28:08,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:08,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317074011] [2023-11-06 22:28:08,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:08,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:28:08,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:08,344 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:28:08,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-06 22:28:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:08,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:28:08,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:09,439 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2023-11-06 22:28:09,543 INFO L322 Elim1Store]: treesize reduction 158, result has 0.6 percent of original size [2023-11-06 22:28:09,543 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 106 treesize of output 1 [2023-11-06 22:28:09,932 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 30 [2023-11-06 22:28:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:28:10,004 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:10,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:10,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317074011] [2023-11-06 22:28:10,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317074011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:10,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:10,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:10,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478075946] [2023-11-06 22:28:10,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:10,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:28:10,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:10,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:28:10,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:10,007 INFO L87 Difference]: Start difference. First operand 352 states and 448 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:28:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:11,977 INFO L93 Difference]: Finished difference Result 591 states and 777 transitions. [2023-11-06 22:28:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:11,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2023-11-06 22:28:11,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:11,983 INFO L225 Difference]: With dead ends: 591 [2023-11-06 22:28:11,984 INFO L226 Difference]: Without dead ends: 589 [2023-11-06 22:28:11,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:28:11,985 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 164 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:11,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 519 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-06 22:28:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2023-11-06 22:28:12,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 459. [2023-11-06 22:28:12,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 399 states have (on average 1.2731829573934836) internal successors, (508), 399 states have internal predecessors, (508), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-06 22:28:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 586 transitions. [2023-11-06 22:28:12,108 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 586 transitions. Word has length 113 [2023-11-06 22:28:12,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:12,109 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 586 transitions. [2023-11-06 22:28:12,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:28:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 586 transitions. [2023-11-06 22:28:12,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-06 22:28:12,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:12,111 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:12,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:12,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:28:12,325 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:12,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:12,325 INFO L85 PathProgramCache]: Analyzing trace with hash 668777620, now seen corresponding path program 1 times [2023-11-06 22:28:12,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:12,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287635658] [2023-11-06 22:28:12,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:12,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:28:12,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:12,328 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:28:12,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-06 22:28:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:12,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:28:12,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:13,839 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2023-11-06 22:28:13,845 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-11-06 22:28:14,161 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:28:14,162 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:14,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:14,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287635658] [2023-11-06 22:28:14,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287635658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:14,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:14,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:28:14,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265937748] [2023-11-06 22:28:14,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:14,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:14,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:14,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:14,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:14,165 INFO L87 Difference]: Start difference. First operand 459 states and 586 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:28:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:15,410 INFO L93 Difference]: Finished difference Result 832 states and 1066 transitions. [2023-11-06 22:28:15,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:28:15,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2023-11-06 22:28:15,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:15,415 INFO L225 Difference]: With dead ends: 832 [2023-11-06 22:28:15,415 INFO L226 Difference]: Without dead ends: 478 [2023-11-06 22:28:15,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:28:15,417 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 188 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:15,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 293 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:28:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2023-11-06 22:28:15,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 459. [2023-11-06 22:28:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 399 states have (on average 1.268170426065163) internal successors, (506), 399 states have internal predecessors, (506), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-06 22:28:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 584 transitions. [2023-11-06 22:28:15,542 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 584 transitions. Word has length 113 [2023-11-06 22:28:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:15,543 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 584 transitions. [2023-11-06 22:28:15,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:28:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 584 transitions. [2023-11-06 22:28:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-06 22:28:15,546 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:15,546 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:15,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-06 22:28:15,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:28:15,765 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:15,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1348835990, now seen corresponding path program 1 times [2023-11-06 22:28:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:15,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027420713] [2023-11-06 22:28:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:15,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:28:15,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:15,768 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:28:15,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-06 22:28:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:16,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:28:16,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:28:16,114 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:16,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:16,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027420713] [2023-11-06 22:28:16,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027420713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:16,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:16,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:28:16,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027288606] [2023-11-06 22:28:16,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:16,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:28:16,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:16,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:28:16,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:16,118 INFO L87 Difference]: Start difference. First operand 459 states and 584 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:28:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:16,266 INFO L93 Difference]: Finished difference Result 847 states and 1084 transitions. [2023-11-06 22:28:16,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:28:16,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2023-11-06 22:28:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:16,269 INFO L225 Difference]: With dead ends: 847 [2023-11-06 22:28:16,269 INFO L226 Difference]: Without dead ends: 493 [2023-11-06 22:28:16,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:16,271 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 33 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:16,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 467 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:28:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2023-11-06 22:28:16,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 471. [2023-11-06 22:28:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 411 states have (on average 1.2603406326034063) internal successors, (518), 411 states have internal predecessors, (518), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-06 22:28:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 596 transitions. [2023-11-06 22:28:16,396 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 596 transitions. Word has length 113 [2023-11-06 22:28:16,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:16,396 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 596 transitions. [2023-11-06 22:28:16,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:28:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 596 transitions. [2023-11-06 22:28:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 22:28:16,400 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:16,401 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:16,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:16,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:28:16,615 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:16,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:16,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2110158779, now seen corresponding path program 1 times [2023-11-06 22:28:16,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:16,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394962333] [2023-11-06 22:28:16,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:16,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:28:16,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:16,617 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:28:16,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-06 22:28:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:17,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:28:17,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:18,170 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2023-11-06 22:28:18,255 INFO L322 Elim1Store]: treesize reduction 158, result has 0.6 percent of original size [2023-11-06 22:28:18,256 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 106 treesize of output 1 [2023-11-06 22:28:18,371 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-11-06 22:28:18,715 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 30 [2023-11-06 22:28:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:28:18,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:18,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:18,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394962333] [2023-11-06 22:28:18,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394962333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:18,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:18,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:28:18,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726040676] [2023-11-06 22:28:18,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:18,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:28:18,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:18,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:28:18,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:28:18,786 INFO L87 Difference]: Start difference. First operand 471 states and 596 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:28:20,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:20,845 INFO L93 Difference]: Finished difference Result 595 states and 778 transitions. [2023-11-06 22:28:20,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:20,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 116 [2023-11-06 22:28:20,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:20,856 INFO L225 Difference]: With dead ends: 595 [2023-11-06 22:28:20,856 INFO L226 Difference]: Without dead ends: 593 [2023-11-06 22:28:20,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:28:20,858 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 274 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:20,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 421 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-06 22:28:20,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2023-11-06 22:28:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 455. [2023-11-06 22:28:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 395 states have (on average 1.2658227848101267) internal successors, (500), 395 states have internal predecessors, (500), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-06 22:28:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 578 transitions. [2023-11-06 22:28:20,979 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 578 transitions. Word has length 116 [2023-11-06 22:28:20,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:20,980 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 578 transitions. [2023-11-06 22:28:20,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:28:20,981 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 578 transitions. [2023-11-06 22:28:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 22:28:20,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:20,983 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:21,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:21,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:28:21,197 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:21,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:21,197 INFO L85 PathProgramCache]: Analyzing trace with hash -333304375, now seen corresponding path program 1 times [2023-11-06 22:28:21,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:21,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575914808] [2023-11-06 22:28:21,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:21,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:28:21,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:21,199 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:28:21,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-06 22:28:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:21,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 22:28:21,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:23,830 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-06 22:28:23,840 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:28:24,864 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2023-11-06 22:28:26,830 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2023-11-06 22:28:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:28:27,370 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:27,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:27,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575914808] [2023-11-06 22:28:27,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575914808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:27,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:27,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:27,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721773486] [2023-11-06 22:28:27,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:27,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:28:27,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:27,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:28:27,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:27,373 INFO L87 Difference]: Start difference. First operand 455 states and 578 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:28:29,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:28:31,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:28:37,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:28:39,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:28:41,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:28:44,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:28:46,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:28:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:49,842 INFO L93 Difference]: Finished difference Result 1045 states and 1334 transitions. [2023-11-06 22:28:49,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:28:49,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 116 [2023-11-06 22:28:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:49,854 INFO L225 Difference]: With dead ends: 1045 [2023-11-06 22:28:49,854 INFO L226 Difference]: Without dead ends: 695 [2023-11-06 22:28:49,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:28:49,856 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 228 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 3 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:49,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 312 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 324 Invalid, 7 Unknown, 0 Unchecked, 20.9s Time] [2023-11-06 22:28:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2023-11-06 22:28:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 569. [2023-11-06 22:28:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 509 states have (on average 1.2573673870333988) internal successors, (640), 509 states have internal predecessors, (640), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-06 22:28:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 718 transitions. [2023-11-06 22:28:49,981 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 718 transitions. Word has length 116 [2023-11-06 22:28:49,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:49,981 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 718 transitions. [2023-11-06 22:28:49,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:28:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 718 transitions. [2023-11-06 22:28:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 22:28:49,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:49,983 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:50,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:50,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:28:50,200 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:50,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:50,200 INFO L85 PathProgramCache]: Analyzing trace with hash -866246057, now seen corresponding path program 1 times [2023-11-06 22:28:50,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:50,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636139988] [2023-11-06 22:28:50,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:50,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:28:50,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:50,205 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:28:50,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-06 22:28:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:50,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:28:50,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:51,156 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:28:51,157 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 26 [2023-11-06 22:28:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:28:51,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:51,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:51,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636139988] [2023-11-06 22:28:51,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636139988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:51,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:51,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:28:51,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811926750] [2023-11-06 22:28:51,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:51,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:28:51,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:51,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:28:51,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:28:51,193 INFO L87 Difference]: Start difference. First operand 569 states and 718 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:28:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:53,359 INFO L93 Difference]: Finished difference Result 1599 states and 2027 transitions. [2023-11-06 22:28:53,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:28:53,360 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 116 [2023-11-06 22:28:53,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:53,366 INFO L225 Difference]: With dead ends: 1599 [2023-11-06 22:28:53,366 INFO L226 Difference]: Without dead ends: 1157 [2023-11-06 22:28:53,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:28:53,368 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 327 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:53,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 596 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-06 22:28:53,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2023-11-06 22:28:53,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 709. [2023-11-06 22:28:53,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 649 states have (on average 1.2573189522342065) internal successors, (816), 649 states have internal predecessors, (816), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-06 22:28:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 894 transitions. [2023-11-06 22:28:53,518 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 894 transitions. Word has length 116 [2023-11-06 22:28:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:53,519 INFO L495 AbstractCegarLoop]: Abstraction has 709 states and 894 transitions. [2023-11-06 22:28:53,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:28:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 894 transitions. [2023-11-06 22:28:53,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 22:28:53,521 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:53,521 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:53,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:53,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:28:53,737 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:53,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:53,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1877363307, now seen corresponding path program 1 times [2023-11-06 22:28:53,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:53,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279544622] [2023-11-06 22:28:53,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:53,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:28:53,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:53,739 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:28:53,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-11-06 22:28:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:53,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:28:53,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:28:54,039 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:54,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:28:54,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279544622] [2023-11-06 22:28:54,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279544622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:54,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:54,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:54,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441978298] [2023-11-06 22:28:54,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:54,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:54,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:28:54,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:54,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:54,042 INFO L87 Difference]: Start difference. First operand 709 states and 894 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:28:54,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:54,299 INFO L93 Difference]: Finished difference Result 1327 states and 1685 transitions. [2023-11-06 22:28:54,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:54,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 116 [2023-11-06 22:28:54,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:54,303 INFO L225 Difference]: With dead ends: 1327 [2023-11-06 22:28:54,303 INFO L226 Difference]: Without dead ends: 761 [2023-11-06 22:28:54,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:28:54,305 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 44 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:54,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 595 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:28:54,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2023-11-06 22:28:54,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 713. [2023-11-06 22:28:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 653 states have (on average 1.2557427258805514) internal successors, (820), 653 states have internal predecessors, (820), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-06 22:28:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 898 transitions. [2023-11-06 22:28:54,433 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 898 transitions. Word has length 116 [2023-11-06 22:28:54,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:54,433 INFO L495 AbstractCegarLoop]: Abstraction has 713 states and 898 transitions. [2023-11-06 22:28:54,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:28:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 898 transitions. [2023-11-06 22:28:54,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-06 22:28:54,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:54,438 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:54,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:54,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:28:54,657 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:54,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:54,657 INFO L85 PathProgramCache]: Analyzing trace with hash 330813212, now seen corresponding path program 1 times [2023-11-06 22:28:54,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:28:54,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377474719] [2023-11-06 22:28:54,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:54,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:28:54,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:28:54,660 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:28:54,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59ee7d8e-eea2-4c51-bbba-ab227e058745/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-11-06 22:28:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:55,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 22:28:55,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:58,022 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2023-11-06 22:29:00,084 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2023-11-06 22:29:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:29:00,497 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:29:00,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:29:00,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377474719] [2023-11-06 22:29:00,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377474719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:29:00,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:29:00,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:29:00,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386438205] [2023-11-06 22:29:00,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:29:00,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:29:00,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:29:00,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:29:00,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:29:00,502 INFO L87 Difference]: Start difference. First operand 713 states and 898 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:29:02,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:29:04,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:29:09,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:29:11,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:29:13,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:29:16,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []