/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound50.c


--------------------------------------------------------------------------------


This is Ultimate 0.2.2-dev-34549b5
[2022-04-07 18:33:32,255 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-04-07 18:33:32,256 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-07 18:33:32,283 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-07 18:33:32,284 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-07 18:33:32,285 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-07 18:33:32,286 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-07 18:33:32,287 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-07 18:33:32,289 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-07 18:33:32,290 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-07 18:33:32,290 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-04-07 18:33:32,296 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-07 18:33:32,297 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-07 18:33:32,297 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-07 18:33:32,298 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-07 18:33:32,299 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-07 18:33:32,300 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-07 18:33:32,300 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-07 18:33:32,302 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-07 18:33:32,303 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-07 18:33:32,305 INFO  L181        SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-07 18:33:32,313 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-07 18:33:32,314 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-07 18:33:32,314 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-04-07 18:33:32,315 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-07 18:33:32,317 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-07 18:33:32,317 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-07 18:33:32,318 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-07 18:33:32,318 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-07 18:33:32,319 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-07 18:33:32,319 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-07 18:33:32,320 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-07 18:33:32,320 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-07 18:33:32,321 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-07 18:33:32,322 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-07 18:33:32,322 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-07 18:33:32,323 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-07 18:33:32,327 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-07 18:33:32,327 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-07 18:33:32,328 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-07 18:33:32,328 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-07 18:33:32,329 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-04-07 18:33:32,330 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf
[2022-04-07 18:33:32,341 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-04-07 18:33:32,341 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-07 18:33:32,342 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-07 18:33:32,342 INFO  L138        SettingsManager]:  * sizeof long=4
[2022-04-07 18:33:32,342 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2022-04-07 18:33:32,342 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2022-04-07 18:33:32,343 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-04-07 18:33:32,343 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2022-04-07 18:33:32,343 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-07 18:33:32,343 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2022-04-07 18:33:32,343 INFO  L138        SettingsManager]:  * sizeof long double=12
[2022-04-07 18:33:32,343 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2022-04-07 18:33:32,343 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2022-04-07 18:33:32,343 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2022-04-07 18:33:32,344 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-07 18:33:32,344 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2022-04-07 18:33:32,344 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2022-04-07 18:33:32,344 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2022-04-07 18:33:32,344 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-07 18:33:32,344 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-07 18:33:32,344 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2022-04-07 18:33:32,345 INFO  L136        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2022-04-07 18:33:32,345 INFO  L138        SettingsManager]:  * TransformationType=LOOP_ACCELERATION_JORDAN
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN;
[2022-04-07 18:33:32,555 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-07 18:33:32,569 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-07 18:33:32,571 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-07 18:33:32,572 INFO  L271        PluginConnector]: Initializing CDTParser...
[2022-04-07 18:33:32,572 INFO  L275        PluginConnector]: CDTParser initialized
[2022-04-07 18:33:32,573 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound50.c
[2022-04-07 18:33:32,618 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63606525f/44322f6bbefb44b3a29d434b35560d76/FLAGd1b924c0d
[2022-04-07 18:33:32,973 INFO  L306              CDTParser]: Found 1 translation units.
[2022-04-07 18:33:32,973 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound50.c
[2022-04-07 18:33:32,978 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63606525f/44322f6bbefb44b3a29d434b35560d76/FLAGd1b924c0d
[2022-04-07 18:33:32,993 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63606525f/44322f6bbefb44b3a29d434b35560d76
[2022-04-07 18:33:32,995 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-07 18:33:32,996 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2022-04-07 18:33:32,997 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-07 18:33:32,997 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-07 18:33:33,004 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-07 18:33:33,005 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 06:33:32" (1/1) ...
[2022-04-07 18:33:33,006 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2392f6d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:33:33, skipping insertion in model container
[2022-04-07 18:33:33,006 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 06:33:32" (1/1) ...
[2022-04-07 18:33:33,015 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2022-04-07 18:33:33,026 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-04-07 18:33:33,166 WARN  L230   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound50.c[525,538]
[2022-04-07 18:33:33,219 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-04-07 18:33:33,226 INFO  L203         MainTranslator]: Completed pre-run
[2022-04-07 18:33:33,241 WARN  L230   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound50.c[525,538]
[2022-04-07 18:33:33,263 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-04-07 18:33:33,277 INFO  L208         MainTranslator]: Completed translation
[2022-04-07 18:33:33,278 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:33:33 WrapperNode
[2022-04-07 18:33:33,278 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-07 18:33:33,279 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-07 18:33:33,279 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-07 18:33:33,279 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-04-07 18:33:33,288 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:33:33" (1/1) ...
[2022-04-07 18:33:33,288 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:33:33" (1/1) ...
[2022-04-07 18:33:33,307 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:33:33" (1/1) ...
[2022-04-07 18:33:33,307 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:33:33" (1/1) ...
[2022-04-07 18:33:33,313 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:33:33" (1/1) ...
[2022-04-07 18:33:33,316 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:33:33" (1/1) ...
[2022-04-07 18:33:33,317 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:33:33" (1/1) ...
[2022-04-07 18:33:33,331 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-07 18:33:33,332 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-07 18:33:33,332 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-04-07 18:33:33,332 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-04-07 18:33:33,333 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:33:33" (1/1) ...
[2022-04-07 18:33:33,340 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-07 18:33:33,346 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-07 18:33:33,355 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-04-07 18:33:33,363 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-04-07 18:33:33,381 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-07 18:33:33,381 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-07 18:33:33,381 INFO  L138     BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-07 18:33:33,382 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-07 18:33:33,382 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-07 18:33:33,382 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2022-04-07 18:33:33,382 INFO  L130     BoogieDeclarations]: Found specification of procedure abort
[2022-04-07 18:33:33,382 INFO  L130     BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-07 18:33:33,382 INFO  L130     BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-07 18:33:33,382 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-07 18:33:33,382 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint
[2022-04-07 18:33:33,383 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-07 18:33:33,383 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-07 18:33:33,383 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2022-04-07 18:33:33,383 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-07 18:33:33,383 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-07 18:33:33,383 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-07 18:33:33,383 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2022-04-07 18:33:33,383 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2022-04-07 18:33:33,384 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-07 18:33:33,430 INFO  L234             CfgBuilder]: Building ICFG
[2022-04-07 18:33:33,432 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-07 18:33:33,579 INFO  L275             CfgBuilder]: Performing block encoding
[2022-04-07 18:33:33,587 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-07 18:33:33,587 INFO  L299             CfgBuilder]: Removed 2 assume(true) statements.
[2022-04-07 18:33:33,589 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 06:33:33 BoogieIcfgContainer
[2022-04-07 18:33:33,589 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-07 18:33:33,590 INFO  L113        PluginConnector]: ------------------------IcfgTransformer----------------------------
[2022-04-07 18:33:33,590 INFO  L271        PluginConnector]: Initializing IcfgTransformer...
[2022-04-07 18:33:33,592 INFO  L275        PluginConnector]: IcfgTransformer initialized
[2022-04-07 18:33:33,594 INFO  L185        PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 06:33:33" (1/1) ...
[2022-04-07 18:33:33,595 INFO  L168   ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN
[2022-04-07 18:33:33,617 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 06:33:33 BasicIcfg
[2022-04-07 18:33:33,618 INFO  L132        PluginConnector]: ------------------------ END IcfgTransformer----------------------------
[2022-04-07 18:33:33,619 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-07 18:33:33,619 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2022-04-07 18:33:33,621 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2022-04-07 18:33:33,621 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 06:33:32" (1/4) ...
[2022-04-07 18:33:33,622 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b0985c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 06:33:33, skipping insertion in model container
[2022-04-07 18:33:33,622 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:33:33" (2/4) ...
[2022-04-07 18:33:33,622 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b0985c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 06:33:33, skipping insertion in model container
[2022-04-07 18:33:33,622 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 06:33:33" (3/4) ...
[2022-04-07 18:33:33,623 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b0985c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 06:33:33, skipping insertion in model container
[2022-04-07 18:33:33,623 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 06:33:33" (4/4) ...
[2022-04-07 18:33:33,624 INFO  L111   eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound50.cJordan
[2022-04-07 18:33:33,628 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION
[2022-04-07 18:33:33,628 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-07 18:33:33,672 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-07 18:33:33,678 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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
[2022-04-07 18:33:33,678 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-07 18:33:33,711 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-07 18:33:33,717 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-04-07 18:33:33,718 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-07 18:33:33,718 INFO  L499         BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-07 18:33:33,719 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-07 18:33:33,725 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-07 18:33:33,726 INFO  L85        PathProgramCache]: Analyzing trace with hash 890522097, now seen corresponding path program 1 times
[2022-04-07 18:33:33,733 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-07 18:33:33,735 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209979920]
[2022-04-07 18:33:33,735 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 18:33:33,736 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-07 18:33:33,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 18:33:33,931 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-07 18:33:33,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 18:33:33,957 INFO  L290        TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {41#true} is VALID
[2022-04-07 18:33:33,957 INFO  L290        TraceCheckUtils]: 1: Hoare triple {41#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {41#true} is VALID
[2022-04-07 18:33:33,958 INFO  L284        TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {41#true} is VALID
[2022-04-07 18:33:33,958 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-07 18:33:33,960 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 18:33:33,965 INFO  L290        TraceCheckUtils]: 0: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1)  InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1}  AuxVars[]  AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID
[2022-04-07 18:33:33,966 INFO  L290        TraceCheckUtils]: 1: Hoare triple {41#true} [116] L9-->L9-2: Formula: false  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {42#false} is VALID
[2022-04-07 18:33:33,966 INFO  L290        TraceCheckUtils]: 2: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {42#false} is VALID
[2022-04-07 18:33:33,966 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 50) 1 0))  InVars {main_~n~0=v_main_~n~0_17}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID
[2022-04-07 18:33:33,967 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-04-07 18:33:33,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 18:33:33,973 INFO  L290        TraceCheckUtils]: 0: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1)  InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1}  AuxVars[]  AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID
[2022-04-07 18:33:33,974 INFO  L290        TraceCheckUtils]: 1: Hoare triple {41#true} [116] L9-->L9-2: Formula: false  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {42#false} is VALID
[2022-04-07 18:33:33,974 INFO  L290        TraceCheckUtils]: 2: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {42#false} is VALID
[2022-04-07 18:33:33,974 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0))  InVars {main_~n~0=v_main_~n~0_18}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID
[2022-04-07 18:33:33,975 INFO  L272        TraceCheckUtils]: 0: Hoare triple {41#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-07 18:33:33,976 INFO  L290        TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {41#true} is VALID
[2022-04-07 18:33:33,976 INFO  L290        TraceCheckUtils]: 2: Hoare triple {41#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {41#true} is VALID
[2022-04-07 18:33:33,976 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {41#true} is VALID
[2022-04-07 18:33:33,976 INFO  L272        TraceCheckUtils]: 4: Hoare triple {41#true} [107] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {41#true} is VALID
[2022-04-07 18:33:33,977 INFO  L290        TraceCheckUtils]: 5: Hoare triple {41#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|)  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1}  AuxVars[]  AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {41#true} is VALID
[2022-04-07 18:33:33,977 INFO  L272        TraceCheckUtils]: 6: Hoare triple {41#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 50) 1 0))  InVars {main_~n~0=v_main_~n~0_17}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {41#true} is VALID
[2022-04-07 18:33:33,977 INFO  L290        TraceCheckUtils]: 7: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1)  InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1}  AuxVars[]  AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID
[2022-04-07 18:33:33,978 INFO  L290        TraceCheckUtils]: 8: Hoare triple {41#true} [116] L9-->L9-2: Formula: false  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {42#false} is VALID
[2022-04-07 18:33:33,978 INFO  L290        TraceCheckUtils]: 9: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {42#false} is VALID
[2022-04-07 18:33:33,978 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 50) 1 0))  InVars {main_~n~0=v_main_~n~0_17}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID
[2022-04-07 18:33:33,978 INFO  L272        TraceCheckUtils]: 11: Hoare triple {42#false} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0))  InVars {main_~n~0=v_main_~n~0_18}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {41#true} is VALID
[2022-04-07 18:33:33,979 INFO  L290        TraceCheckUtils]: 12: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1)  InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1}  AuxVars[]  AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID
[2022-04-07 18:33:33,979 INFO  L290        TraceCheckUtils]: 13: Hoare triple {41#true} [116] L9-->L9-2: Formula: false  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {42#false} is VALID
[2022-04-07 18:33:33,979 INFO  L290        TraceCheckUtils]: 14: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {42#false} is VALID
[2022-04-07 18:33:33,980 INFO  L284        TraceCheckUtils]: 15: Hoare quadruple {42#false} {42#false} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0))  InVars {main_~n~0=v_main_~n~0_18}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID
[2022-04-07 18:33:33,980 INFO  L290        TraceCheckUtils]: 16: Hoare triple {42#false} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0))  InVars {main_~n~0=v_main_~n~0_6}  OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2}  AuxVars[]  AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {42#false} is VALID
[2022-04-07 18:33:33,980 INFO  L290        TraceCheckUtils]: 17: Hoare triple {42#false} [118] L30-2-->L52-2: Formula: false  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {42#false} is VALID
[2022-04-07 18:33:33,980 INFO  L290        TraceCheckUtils]: 18: Hoare triple {42#false} [122] L52-2-->L38-1: Formula: false  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {42#false} is VALID
[2022-04-07 18:33:33,981 INFO  L272        TraceCheckUtils]: 19: Hoare triple {42#false} [127] L38-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_24 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0) (* (* v_main_~n~0_24 .cse0) 4294967295))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|)  InVars {main_~n~0=v_main_~n~0_24, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|}  AuxVars[]  AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {42#false} is VALID
[2022-04-07 18:33:33,981 INFO  L290        TraceCheckUtils]: 20: Hoare triple {42#false} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|)  InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1}  AuxVars[]  AssignedVars[__VERIFIER_assert_~cond] {42#false} is VALID
[2022-04-07 18:33:33,981 INFO  L290        TraceCheckUtils]: 21: Hoare triple {42#false} [133] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0)  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2}  AuxVars[]  AssignedVars[] {42#false} is VALID
[2022-04-07 18:33:33,981 INFO  L290        TraceCheckUtils]: 22: Hoare triple {42#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {42#false} is VALID
[2022-04-07 18:33:33,982 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-07 18:33:33,982 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-07 18:33:33,982 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209979920]
[2022-04-07 18:33:33,983 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209979920] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-07 18:33:33,983 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-07 18:33:33,983 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-07 18:33:33,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997450045]
[2022-04-07 18:33:33,985 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-07 18:33:33,989 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23
[2022-04-07 18:33:33,990 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-04-07 18:33:33,992 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with  has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-07 18:33:34,016 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-07 18:33:34,017 INFO  L554      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-07 18:33:34,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-07 18:33:34,043 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-07 18:33:34,044 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-07 18:33:34,046 INFO  L87              Difference]: Start difference. First operand  has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand  has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-07 18:33:36,346 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []
[2022-04-07 18:33:41,035 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 18:33:41,035 INFO  L93              Difference]: Finished difference Result 38 states and 49 transitions.
[2022-04-07 18:33:41,035 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-04-07 18:33:41,036 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23
[2022-04-07 18:33:41,036 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-07 18:33:41,037 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-07 18:33:41,043 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions.
[2022-04-07 18:33:41,044 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-07 18:33:41,047 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions.
[2022-04-07 18:33:41,047 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions.
[2022-04-07 18:33:41,160 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-07 18:33:41,168 INFO  L225             Difference]: With dead ends: 38
[2022-04-07 18:33:41,168 INFO  L226             Difference]: Without dead ends: 33
[2022-04-07 18:33:41,169 INFO  L912         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-07 18:33:41,172 INFO  L913         BasicCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2022-04-07 18:33:41,173 INFO  L914         BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time]
[2022-04-07 18:33:41,186 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2022-04-07 18:33:41,197 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33.
[2022-04-07 18:33:41,197 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-07 18:33:41,198 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand  has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2022-04-07 18:33:41,198 INFO  L74              IsIncluded]: Start isIncluded. First operand 33 states. Second operand  has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2022-04-07 18:33:41,199 INFO  L87              Difference]: Start difference. First operand 33 states. Second operand  has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2022-04-07 18:33:41,204 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 18:33:41,205 INFO  L93              Difference]: Finished difference Result 33 states and 44 transitions.
[2022-04-07 18:33:41,205 INFO  L276                IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions.
[2022-04-07 18:33:41,206 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 18:33:41,206 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 18:33:41,206 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states.
[2022-04-07 18:33:41,207 INFO  L87              Difference]: Start difference. First operand  has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states.
[2022-04-07 18:33:41,211 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 18:33:41,211 INFO  L93              Difference]: Finished difference Result 33 states and 44 transitions.
[2022-04-07 18:33:41,211 INFO  L276                IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions.
[2022-04-07 18:33:41,212 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 18:33:41,212 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 18:33:41,212 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-04-07 18:33:41,212 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-07 18:33:41,213 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2022-04-07 18:33:41,216 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions.
[2022-04-07 18:33:41,217 INFO  L78                 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23
[2022-04-07 18:33:41,217 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-04-07 18:33:41,217 INFO  L478      AbstractCegarLoop]: Abstraction has 33 states and 44 transitions.
[2022-04-07 18:33:41,217 INFO  L479      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-07 18:33:41,218 INFO  L276                IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions.
[2022-04-07 18:33:41,218 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2022-04-07 18:33:41,218 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-07 18:33:41,218 INFO  L499         BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-07 18:33:41,219 WARN  L460      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-07 18:33:41,219 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-07 18:33:41,220 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-07 18:33:41,220 INFO  L85        PathProgramCache]: Analyzing trace with hash 1386957495, now seen corresponding path program 1 times
[2022-04-07 18:33:41,220 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-07 18:33:41,220 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538644574]
[2022-04-07 18:33:41,220 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 18:33:41,221 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-07 18:33:41,264 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 18:33:41,451 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-07 18:33:41,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 18:33:41,471 INFO  L290        TraceCheckUtils]: 0: Hoare triple {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {194#true} is VALID
[2022-04-07 18:33:41,471 INFO  L290        TraceCheckUtils]: 1: Hoare triple {194#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {194#true} is VALID
[2022-04-07 18:33:41,472 INFO  L284        TraceCheckUtils]: 2: Hoare quadruple {194#true} {194#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {194#true} is VALID
[2022-04-07 18:33:41,472 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-07 18:33:41,473 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 18:33:41,478 INFO  L290        TraceCheckUtils]: 0: Hoare triple {194#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1)  InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1}  AuxVars[]  AssignedVars[assume_abort_if_not_~cond] {194#true} is VALID
[2022-04-07 18:33:41,479 INFO  L290        TraceCheckUtils]: 1: Hoare triple {194#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0))  InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  AuxVars[]  AssignedVars[] {194#true} is VALID
[2022-04-07 18:33:41,479 INFO  L290        TraceCheckUtils]: 2: Hoare triple {194#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {194#true} is VALID
[2022-04-07 18:33:41,480 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 50) 1 0))  InVars {main_~n~0=v_main_~n~0_17}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID
[2022-04-07 18:33:41,481 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-04-07 18:33:41,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 18:33:41,488 INFO  L290        TraceCheckUtils]: 0: Hoare triple {194#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1)  InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1}  AuxVars[]  AssignedVars[assume_abort_if_not_~cond] {194#true} is VALID
[2022-04-07 18:33:41,489 INFO  L290        TraceCheckUtils]: 1: Hoare triple {194#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0))  InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  AuxVars[]  AssignedVars[] {194#true} is VALID
[2022-04-07 18:33:41,489 INFO  L290        TraceCheckUtils]: 2: Hoare triple {194#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {194#true} is VALID
[2022-04-07 18:33:41,489 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0))  InVars {main_~n~0=v_main_~n~0_18}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID
[2022-04-07 18:33:41,490 INFO  L272        TraceCheckUtils]: 0: Hoare triple {194#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-07 18:33:41,490 INFO  L290        TraceCheckUtils]: 1: Hoare triple {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {194#true} is VALID
[2022-04-07 18:33:41,491 INFO  L290        TraceCheckUtils]: 2: Hoare triple {194#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {194#true} is VALID
[2022-04-07 18:33:41,494 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {194#true} is VALID
[2022-04-07 18:33:41,495 INFO  L272        TraceCheckUtils]: 4: Hoare triple {194#true} [107] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {194#true} is VALID
[2022-04-07 18:33:41,495 INFO  L290        TraceCheckUtils]: 5: Hoare triple {194#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|)  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1}  AuxVars[]  AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {194#true} is VALID
[2022-04-07 18:33:41,495 INFO  L272        TraceCheckUtils]: 6: Hoare triple {194#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 50) 1 0))  InVars {main_~n~0=v_main_~n~0_17}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID
[2022-04-07 18:33:41,495 INFO  L290        TraceCheckUtils]: 7: Hoare triple {194#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1)  InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1}  AuxVars[]  AssignedVars[assume_abort_if_not_~cond] {194#true} is VALID
[2022-04-07 18:33:41,496 INFO  L290        TraceCheckUtils]: 8: Hoare triple {194#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0))  InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  AuxVars[]  AssignedVars[] {194#true} is VALID
[2022-04-07 18:33:41,496 INFO  L290        TraceCheckUtils]: 9: Hoare triple {194#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {194#true} is VALID
[2022-04-07 18:33:41,496 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {194#true} {194#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 50) 1 0))  InVars {main_~n~0=v_main_~n~0_17}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID
[2022-04-07 18:33:41,496 INFO  L272        TraceCheckUtils]: 11: Hoare triple {194#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0))  InVars {main_~n~0=v_main_~n~0_18}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID
[2022-04-07 18:33:41,497 INFO  L290        TraceCheckUtils]: 12: Hoare triple {194#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1)  InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1}  AuxVars[]  AssignedVars[assume_abort_if_not_~cond] {194#true} is VALID
[2022-04-07 18:33:41,497 INFO  L290        TraceCheckUtils]: 13: Hoare triple {194#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0))  InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  AuxVars[]  AssignedVars[] {194#true} is VALID
[2022-04-07 18:33:41,497 INFO  L290        TraceCheckUtils]: 14: Hoare triple {194#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {194#true} is VALID
[2022-04-07 18:33:41,497 INFO  L284        TraceCheckUtils]: 15: Hoare quadruple {194#true} {194#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0))  InVars {main_~n~0=v_main_~n~0_18}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {194#true} is VALID
[2022-04-07 18:33:41,501 INFO  L290        TraceCheckUtils]: 16: Hoare triple {194#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0))  InVars {main_~n~0=v_main_~n~0_6}  OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2}  AuxVars[]  AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {207#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID
[2022-04-07 18:33:41,502 INFO  L290        TraceCheckUtils]: 17: Hoare triple {207#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [120] L30-2-->L31: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {207#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID
[2022-04-07 18:33:41,503 INFO  L290        TraceCheckUtils]: 18: Hoare triple {207#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296)))  InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7}  OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7}  AuxVars[]  AssignedVars[] {208#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID
[2022-04-07 18:33:41,503 INFO  L290        TraceCheckUtils]: 19: Hoare triple {208#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [124] L52-2-->L39: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {208#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID
[2022-04-07 18:33:41,505 INFO  L272        TraceCheckUtils]: 20: Hoare triple {208#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {209#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-07 18:33:41,505 INFO  L290        TraceCheckUtils]: 21: Hoare triple {209#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|)  InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1}  AuxVars[]  AssignedVars[__VERIFIER_assert_~cond] {210#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-07 18:33:41,506 INFO  L290        TraceCheckUtils]: 22: Hoare triple {210#(not (= __VERIFIER_assert_~cond 0))} [133] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0)  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2}  AuxVars[]  AssignedVars[] {195#false} is VALID
[2022-04-07 18:33:41,506 INFO  L290        TraceCheckUtils]: 23: Hoare triple {195#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {195#false} is VALID
[2022-04-07 18:33:41,508 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-07 18:33:41,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-07 18:33:41,508 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538644574]
[2022-04-07 18:33:41,509 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538644574] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-07 18:33:41,509 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-07 18:33:41,509 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-04-07 18:33:41,510 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521727139]
[2022-04-07 18:33:41,510 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-07 18:33:41,511 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24
[2022-04-07 18:33:41,512 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-04-07 18:33:41,512 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with  has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-07 18:33:41,532 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-07 18:33:41,533 INFO  L554      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-07 18:33:41,536 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-07 18:33:41,536 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-07 18:33:41,537 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2022-04-07 18:33:41,537 INFO  L87              Difference]: Start difference. First operand 33 states and 44 transitions. Second operand  has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-07 18:33:46,931 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2022-04-07 18:33:49,687 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []
[2022-04-07 18:33:57,267 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2022-04-07 18:33:59,271 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2022-04-07 18:34:03,741 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2022-04-07 18:34:05,793 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2022-04-07 18:34:07,795 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2022-04-07 18:34:09,798 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2022-04-07 18:34:12,159 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []
[2022-04-07 18:34:15,542 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2022-04-07 18:34:15,644 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 18:34:15,645 INFO  L93              Difference]: Finished difference Result 50 states and 69 transitions.
[2022-04-07 18:34:15,645 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2022-04-07 18:34:15,645 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24
[2022-04-07 18:34:15,645 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-07 18:34:15,646 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-07 18:34:15,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions.
[2022-04-07 18:34:15,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-07 18:34:15,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions.
[2022-04-07 18:34:15,654 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 71 transitions.
[2022-04-07 18:34:15,873 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-07 18:34:15,875 INFO  L225             Difference]: With dead ends: 50
[2022-04-07 18:34:15,876 INFO  L226             Difference]: Without dead ends: 48
[2022-04-07 18:34:15,876 INFO  L912         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2022-04-07 18:34:15,877 INFO  L913         BasicCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 49 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time
[2022-04-07 18:34:15,877 INFO  L914         BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 60 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 198 Invalid, 10 Unknown, 0 Unchecked, 25.4s Time]
[2022-04-07 18:34:15,878 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2022-04-07 18:34:15,883 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2022-04-07 18:34:15,883 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-07 18:34:15,884 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand  has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17)
[2022-04-07 18:34:15,885 INFO  L74              IsIncluded]: Start isIncluded. First operand 48 states. Second operand  has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17)
[2022-04-07 18:34:15,885 INFO  L87              Difference]: Start difference. First operand 48 states. Second operand  has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17)
[2022-04-07 18:34:15,889 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 18:34:15,889 INFO  L93              Difference]: Finished difference Result 48 states and 65 transitions.
[2022-04-07 18:34:15,889 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions.
[2022-04-07 18:34:15,890 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 18:34:15,891 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 18:34:15,891 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states.
[2022-04-07 18:34:15,892 INFO  L87              Difference]: Start difference. First operand  has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states.
[2022-04-07 18:34:15,896 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 18:34:15,896 INFO  L93              Difference]: Finished difference Result 48 states and 65 transitions.
[2022-04-07 18:34:15,896 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions.
[2022-04-07 18:34:15,897 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 18:34:15,897 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 18:34:15,898 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-04-07 18:34:15,898 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-07 18:34:15,898 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17)
[2022-04-07 18:34:15,901 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions.
[2022-04-07 18:34:15,902 INFO  L78                 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 24
[2022-04-07 18:34:15,902 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-04-07 18:34:15,902 INFO  L478      AbstractCegarLoop]: Abstraction has 48 states and 65 transitions.
[2022-04-07 18:34:15,902 INFO  L479      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-07 18:34:15,903 INFO  L276                IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions.
[2022-04-07 18:34:15,903 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2022-04-07 18:34:15,903 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-07 18:34:15,904 INFO  L499         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-07 18:34:15,904 WARN  L460      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-04-07 18:34:15,904 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-07 18:34:15,904 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-07 18:34:15,904 INFO  L85        PathProgramCache]: Analyzing trace with hash -472493455, now seen corresponding path program 1 times
[2022-04-07 18:34:15,905 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-07 18:34:15,905 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139356148]
[2022-04-07 18:34:15,905 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 18:34:15,905 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-07 18:34:15,931 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 18:34:16,125 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-07 18:34:16,128 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 18:34:16,133 INFO  L290        TraceCheckUtils]: 0: Hoare triple {435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {418#true} is VALID
[2022-04-07 18:34:16,133 INFO  L290        TraceCheckUtils]: 1: Hoare triple {418#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {418#true} is VALID
[2022-04-07 18:34:16,134 INFO  L284        TraceCheckUtils]: 2: Hoare quadruple {418#true} {418#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {418#true} is VALID
[2022-04-07 18:34:16,134 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-07 18:34:16,135 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 18:34:16,139 INFO  L290        TraceCheckUtils]: 0: Hoare triple {418#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1)  InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1}  AuxVars[]  AssignedVars[assume_abort_if_not_~cond] {418#true} is VALID
[2022-04-07 18:34:16,139 INFO  L290        TraceCheckUtils]: 1: Hoare triple {418#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0))  InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  AuxVars[]  AssignedVars[] {418#true} is VALID
[2022-04-07 18:34:16,140 INFO  L290        TraceCheckUtils]: 2: Hoare triple {418#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {418#true} is VALID
[2022-04-07 18:34:16,140 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {418#true} {418#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 50) 1 0))  InVars {main_~n~0=v_main_~n~0_17}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {418#true} is VALID
[2022-04-07 18:34:16,140 INFO  L376   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2022-04-07 18:34:16,141 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 18:34:16,145 INFO  L290        TraceCheckUtils]: 0: Hoare triple {418#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1)  InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1}  AuxVars[]  AssignedVars[assume_abort_if_not_~cond] {418#true} is VALID
[2022-04-07 18:34:16,146 INFO  L290        TraceCheckUtils]: 1: Hoare triple {418#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0))  InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  AuxVars[]  AssignedVars[] {418#true} is VALID
[2022-04-07 18:34:16,146 INFO  L290        TraceCheckUtils]: 2: Hoare triple {418#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {418#true} is VALID
[2022-04-07 18:34:16,146 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {418#true} {418#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0))  InVars {main_~n~0=v_main_~n~0_18}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {418#true} is VALID
[2022-04-07 18:34:16,147 INFO  L272        TraceCheckUtils]: 0: Hoare triple {418#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-07 18:34:16,147 INFO  L290        TraceCheckUtils]: 1: Hoare triple {435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {418#true} is VALID
[2022-04-07 18:34:16,148 INFO  L290        TraceCheckUtils]: 2: Hoare triple {418#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {418#true} is VALID
[2022-04-07 18:34:16,148 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {418#true} {418#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {418#true} is VALID
[2022-04-07 18:34:16,148 INFO  L272        TraceCheckUtils]: 4: Hoare triple {418#true} [107] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {418#true} is VALID
[2022-04-07 18:34:16,148 INFO  L290        TraceCheckUtils]: 5: Hoare triple {418#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|)  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1}  AuxVars[]  AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {418#true} is VALID
[2022-04-07 18:34:16,149 INFO  L272        TraceCheckUtils]: 6: Hoare triple {418#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 50) 1 0))  InVars {main_~n~0=v_main_~n~0_17}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {418#true} is VALID
[2022-04-07 18:34:16,149 INFO  L290        TraceCheckUtils]: 7: Hoare triple {418#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1)  InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1}  AuxVars[]  AssignedVars[assume_abort_if_not_~cond] {418#true} is VALID
[2022-04-07 18:34:16,149 INFO  L290        TraceCheckUtils]: 8: Hoare triple {418#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0))  InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  AuxVars[]  AssignedVars[] {418#true} is VALID
[2022-04-07 18:34:16,149 INFO  L290        TraceCheckUtils]: 9: Hoare triple {418#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {418#true} is VALID
[2022-04-07 18:34:16,149 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {418#true} {418#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 50) 1 0))  InVars {main_~n~0=v_main_~n~0_17}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {418#true} is VALID
[2022-04-07 18:34:16,150 INFO  L272        TraceCheckUtils]: 11: Hoare triple {418#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0))  InVars {main_~n~0=v_main_~n~0_18}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {418#true} is VALID
[2022-04-07 18:34:16,150 INFO  L290        TraceCheckUtils]: 12: Hoare triple {418#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1)  InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1}  AuxVars[]  AssignedVars[assume_abort_if_not_~cond] {418#true} is VALID
[2022-04-07 18:34:16,150 INFO  L290        TraceCheckUtils]: 13: Hoare triple {418#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0))  InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  AuxVars[]  AssignedVars[] {418#true} is VALID
[2022-04-07 18:34:16,150 INFO  L290        TraceCheckUtils]: 14: Hoare triple {418#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {418#true} is VALID
[2022-04-07 18:34:16,151 INFO  L284        TraceCheckUtils]: 15: Hoare quadruple {418#true} {418#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0))  InVars {main_~n~0=v_main_~n~0_18}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {418#true} is VALID
[2022-04-07 18:34:16,151 INFO  L290        TraceCheckUtils]: 16: Hoare triple {418#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0))  InVars {main_~n~0=v_main_~n~0_6}  OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2}  AuxVars[]  AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {431#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID
[2022-04-07 18:34:16,152 INFO  L290        TraceCheckUtils]: 17: Hoare triple {431#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [120] L30-2-->L31: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {431#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID
[2022-04-07 18:34:16,152 INFO  L290        TraceCheckUtils]: 18: Hoare triple {431#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [126] L31-->L30-2: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_8 4294967296)))  InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_8}  OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_8}  AuxVars[]  AssignedVars[main_~q~0] {431#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID
[2022-04-07 18:34:16,153 INFO  L290        TraceCheckUtils]: 19: Hoare triple {431#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [120] L30-2-->L31: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {431#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID
[2022-04-07 18:34:16,154 INFO  L290        TraceCheckUtils]: 20: Hoare triple {431#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296)))  InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7}  OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7}  AuxVars[]  AssignedVars[] {432#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID
[2022-04-07 18:34:16,155 INFO  L290        TraceCheckUtils]: 21: Hoare triple {432#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} [124] L52-2-->L39: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {432#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID
[2022-04-07 18:34:16,157 INFO  L272        TraceCheckUtils]: 22: Hoare triple {432#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {433#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-07 18:34:16,157 INFO  L290        TraceCheckUtils]: 23: Hoare triple {433#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|)  InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1}  AuxVars[]  AssignedVars[__VERIFIER_assert_~cond] {434#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-07 18:34:16,158 INFO  L290        TraceCheckUtils]: 24: Hoare triple {434#(not (= __VERIFIER_assert_~cond 0))} [133] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0)  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2}  AuxVars[]  AssignedVars[] {419#false} is VALID
[2022-04-07 18:34:16,158 INFO  L290        TraceCheckUtils]: 25: Hoare triple {419#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {419#false} is VALID
[2022-04-07 18:34:16,159 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2022-04-07 18:34:16,159 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-07 18:34:16,159 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139356148]
[2022-04-07 18:34:16,159 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139356148] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-07 18:34:16,159 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-07 18:34:16,159 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-04-07 18:34:16,160 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365494679]
[2022-04-07 18:34:16,160 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-07 18:34:16,160 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26
[2022-04-07 18:34:16,160 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-04-07 18:34:16,161 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with  has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-07 18:34:16,180 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-07 18:34:16,180 INFO  L554      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-07 18:34:16,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-07 18:34:16,181 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-07 18:34:16,181 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2022-04-07 18:34:16,181 INFO  L87              Difference]: Start difference. First operand 48 states and 65 transitions. Second operand  has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-07 18:34:19,689 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []
[2022-04-07 18:34:26,290 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []
[2022-04-07 18:34:32,511 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []
[2022-04-07 18:34:34,989 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []
[2022-04-07 18:34:48,023 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []
[2022-04-07 18:34:48,532 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 18:34:48,532 INFO  L93              Difference]: Finished difference Result 75 states and 110 transitions.
[2022-04-07 18:34:48,532 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2022-04-07 18:34:48,532 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26
[2022-04-07 18:34:48,533 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-07 18:34:48,533 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-07 18:34:48,536 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions.
[2022-04-07 18:34:48,537 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-07 18:34:48,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions.
[2022-04-07 18:34:48,540 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 90 transitions.
[2022-04-07 18:34:48,971 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-07 18:34:48,976 INFO  L225             Difference]: With dead ends: 75
[2022-04-07 18:34:48,976 INFO  L226             Difference]: Without dead ends: 71
[2022-04-07 18:34:48,976 INFO  L912         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2022-04-07 18:34:48,977 INFO  L913         BasicCegarLoop]: 27 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 79 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time
[2022-04-07 18:34:48,978 INFO  L914         BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 49 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 217 Invalid, 5 Unknown, 0 Unchecked, 15.1s Time]
[2022-04-07 18:34:48,978 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 71 states.
[2022-04-07 18:34:48,984 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63.
[2022-04-07 18:34:48,984 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-07 18:34:48,985 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand  has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24)
[2022-04-07 18:34:48,986 INFO  L74              IsIncluded]: Start isIncluded. First operand 71 states. Second operand  has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24)
[2022-04-07 18:34:48,986 INFO  L87              Difference]: Start difference. First operand 71 states. Second operand  has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24)
[2022-04-07 18:34:48,991 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 18:34:48,991 INFO  L93              Difference]: Finished difference Result 71 states and 102 transitions.
[2022-04-07 18:34:48,992 INFO  L276                IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions.
[2022-04-07 18:34:48,993 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 18:34:48,993 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 18:34:48,994 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states.
[2022-04-07 18:34:48,995 INFO  L87              Difference]: Start difference. First operand  has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states.
[2022-04-07 18:34:49,000 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 18:34:49,000 INFO  L93              Difference]: Finished difference Result 71 states and 102 transitions.
[2022-04-07 18:34:49,000 INFO  L276                IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions.
[2022-04-07 18:34:49,001 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 18:34:49,002 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 18:34:49,002 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-04-07 18:34:49,002 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-07 18:34:49,003 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24)
[2022-04-07 18:34:49,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions.
[2022-04-07 18:34:49,006 INFO  L78                 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 26
[2022-04-07 18:34:49,006 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-04-07 18:34:49,006 INFO  L478      AbstractCegarLoop]: Abstraction has 63 states and 88 transitions.
[2022-04-07 18:34:49,007 INFO  L479      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-07 18:34:49,007 INFO  L276                IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions.
[2022-04-07 18:34:49,008 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2022-04-07 18:34:49,008 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-07 18:34:49,008 INFO  L499         BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-07 18:34:49,008 WARN  L460      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-04-07 18:34:49,008 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-07 18:34:49,009 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-07 18:34:49,009 INFO  L85        PathProgramCache]: Analyzing trace with hash 1385093780, now seen corresponding path program 1 times
[2022-04-07 18:34:49,009 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-07 18:34:49,009 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7782421]
[2022-04-07 18:34:49,009 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 18:34:49,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-07 18:34:49,024 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-07 18:34:49,024 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [95308482]
[2022-04-07 18:34:49,025 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 18:34:49,025 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 18:34:49,025 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-07 18:34:49,036 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-07 18:34:49,039 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-04-07 18:34:49,108 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 18:34:49,110 INFO  L263         TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core
[2022-04-07 18:34:49,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 18:34:49,141 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-04-07 18:34:49,442 INFO  L272        TraceCheckUtils]: 0: Hoare triple {728#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {728#true} is VALID
[2022-04-07 18:34:49,443 INFO  L290        TraceCheckUtils]: 1: Hoare triple {728#true} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {728#true} is VALID
[2022-04-07 18:34:49,443 INFO  L290        TraceCheckUtils]: 2: Hoare triple {728#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {728#true} is VALID
[2022-04-07 18:34:49,443 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {728#true} {728#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {728#true} is VALID
[2022-04-07 18:34:49,443 INFO  L272        TraceCheckUtils]: 4: Hoare triple {728#true} [107] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {728#true} is VALID
[2022-04-07 18:34:49,443 INFO  L290        TraceCheckUtils]: 5: Hoare triple {728#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|)  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1}  AuxVars[]  AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {728#true} is VALID
[2022-04-07 18:34:49,444 INFO  L272        TraceCheckUtils]: 6: Hoare triple {728#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 50) 1 0))  InVars {main_~n~0=v_main_~n~0_17}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {728#true} is VALID
[2022-04-07 18:34:49,444 INFO  L290        TraceCheckUtils]: 7: Hoare triple {728#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1)  InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1}  AuxVars[]  AssignedVars[assume_abort_if_not_~cond] {728#true} is VALID
[2022-04-07 18:34:49,444 INFO  L290        TraceCheckUtils]: 8: Hoare triple {728#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0))  InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  AuxVars[]  AssignedVars[] {728#true} is VALID
[2022-04-07 18:34:49,444 INFO  L290        TraceCheckUtils]: 9: Hoare triple {728#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {728#true} is VALID
[2022-04-07 18:34:49,444 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {728#true} {728#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 50) 1 0))  InVars {main_~n~0=v_main_~n~0_17}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {728#true} is VALID
[2022-04-07 18:34:49,444 INFO  L272        TraceCheckUtils]: 11: Hoare triple {728#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0))  InVars {main_~n~0=v_main_~n~0_18}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {728#true} is VALID
[2022-04-07 18:34:49,445 INFO  L290        TraceCheckUtils]: 12: Hoare triple {728#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1)  InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1}  AuxVars[]  AssignedVars[assume_abort_if_not_~cond] {728#true} is VALID
[2022-04-07 18:34:49,445 INFO  L290        TraceCheckUtils]: 13: Hoare triple {728#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0))  InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  AuxVars[]  AssignedVars[] {728#true} is VALID
[2022-04-07 18:34:49,445 INFO  L290        TraceCheckUtils]: 14: Hoare triple {728#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {728#true} is VALID
[2022-04-07 18:34:49,445 INFO  L284        TraceCheckUtils]: 15: Hoare quadruple {728#true} {728#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0))  InVars {main_~n~0=v_main_~n~0_18}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {728#true} is VALID
[2022-04-07 18:34:49,449 INFO  L290        TraceCheckUtils]: 16: Hoare triple {728#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0))  InVars {main_~n~0=v_main_~n~0_6}  OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2}  AuxVars[]  AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID
[2022-04-07 18:34:49,449 INFO  L290        TraceCheckUtils]: 17: Hoare triple {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [120] L30-2-->L31: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID
[2022-04-07 18:34:49,450 INFO  L290        TraceCheckUtils]: 18: Hoare triple {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296)))  InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7}  OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7}  AuxVars[]  AssignedVars[] {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID
[2022-04-07 18:34:49,451 INFO  L290        TraceCheckUtils]: 19: Hoare triple {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [124] L52-2-->L39: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID
[2022-04-07 18:34:49,451 INFO  L272        TraceCheckUtils]: 20: Hoare triple {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {728#true} is VALID
[2022-04-07 18:34:49,451 INFO  L290        TraceCheckUtils]: 21: Hoare triple {728#true} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|)  InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1}  AuxVars[]  AssignedVars[__VERIFIER_assert_~cond] {728#true} is VALID
[2022-04-07 18:34:49,452 INFO  L290        TraceCheckUtils]: 22: Hoare triple {728#true} [134] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {728#true} is VALID
[2022-04-07 18:34:49,452 INFO  L290        TraceCheckUtils]: 23: Hoare triple {728#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {728#true} is VALID
[2022-04-07 18:34:49,468 INFO  L284        TraceCheckUtils]: 24: Hoare quadruple {728#true} {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [151] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID
[2022-04-07 18:34:49,468 INFO  L272        TraceCheckUtils]: 25: Hoare triple {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [131] L39-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|)  InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {728#true} is VALID
[2022-04-07 18:34:49,469 INFO  L290        TraceCheckUtils]: 26: Hoare triple {728#true} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|)  InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1}  AuxVars[]  AssignedVars[__VERIFIER_assert_~cond] {728#true} is VALID
[2022-04-07 18:34:49,469 INFO  L290        TraceCheckUtils]: 27: Hoare triple {728#true} [134] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {728#true} is VALID
[2022-04-07 18:34:49,469 INFO  L290        TraceCheckUtils]: 28: Hoare triple {728#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {728#true} is VALID
[2022-04-07 18:34:49,470 INFO  L284        TraceCheckUtils]: 29: Hoare quadruple {728#true} {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [152] __VERIFIER_assertEXIT-->L40: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|)  InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID
[2022-04-07 18:34:49,472 INFO  L272        TraceCheckUtils]: 30: Hoare triple {781#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [135] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (let ((.cse0 (* v_main_~h~0_11 12))) (+ (* v_main_~r~0_17 (* v_main_~q~0_18 .cse0)) (* 4294967295 (* v_main_~r~0_17 (* v_main_~q~0_18 (* v_main_~p~0_18 16)))) (* (* v_main_~q~0_18 (* v_main_~q~0_18 (* v_main_~p~0_18 4))) 4294967295) (* 4294967295 (* v_main_~q~0_18 (* v_main_~n~0_20 .cse0))) (* 4294967295 (* v_main_~q~0_18 (* v_main_~h~0_11 v_main_~q~0_18))) (* v_main_~q~0_18 (* v_main_~p~0_18 (* v_main_~n~0_20 16))) (* v_main_~h~0_11 (* v_main_~h~0_11 v_main_~h~0_11)))) 4294967296) 0) 1 0))  InVars {main_~q~0=v_main_~q~0_18, main_~n~0=v_main_~n~0_20, main_~h~0=v_main_~h~0_11, main_~p~0=v_main_~p~0_18, main_~r~0=v_main_~r~0_17}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {824#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-07 18:34:49,472 INFO  L290        TraceCheckUtils]: 31: Hoare triple {824#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|)  InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1}  AuxVars[]  AssignedVars[__VERIFIER_assert_~cond] {828#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-07 18:34:49,473 INFO  L290        TraceCheckUtils]: 32: Hoare triple {828#(<= 1 __VERIFIER_assert_~cond)} [133] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0)  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2}  AuxVars[]  AssignedVars[] {729#false} is VALID
[2022-04-07 18:34:49,473 INFO  L290        TraceCheckUtils]: 33: Hoare triple {729#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {729#false} is VALID
[2022-04-07 18:34:49,473 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2022-04-07 18:34:49,474 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-07 18:34:49,474 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-07 18:34:49,474 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7782421]
[2022-04-07 18:34:49,474 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-07 18:34:49,474 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95308482]
[2022-04-07 18:34:49,474 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [95308482] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-07 18:34:49,474 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-07 18:34:49,474 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-07 18:34:49,475 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954426564]
[2022-04-07 18:34:49,475 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-07 18:34:49,475 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34
[2022-04-07 18:34:49,476 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-04-07 18:34:49,476 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with  has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 18:34:49,507 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-07 18:34:49,507 INFO  L554      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-07 18:34:49,507 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-07 18:34:49,508 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-07 18:34:49,508 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-07 18:34:49,508 INFO  L87              Difference]: Start difference. First operand 63 states and 88 transitions. Second operand  has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 18:34:54,679 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 18:34:54,679 INFO  L93              Difference]: Finished difference Result 72 states and 95 transitions.
[2022-04-07 18:34:54,680 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2022-04-07 18:34:54,680 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34
[2022-04-07 18:34:54,680 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-07 18:34:54,680 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 18:34:54,682 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions.
[2022-04-07 18:34:54,682 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 18:34:54,684 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions.
[2022-04-07 18:34:54,684 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions.
[2022-04-07 18:34:54,767 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-07 18:34:54,769 INFO  L225             Difference]: With dead ends: 72
[2022-04-07 18:34:54,769 INFO  L226             Difference]: Without dead ends: 51
[2022-04-07 18:34:54,769 INFO  L912         BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2022-04-07 18:34:54,770 INFO  L913         BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2022-04-07 18:34:54,770 INFO  L914         BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2022-04-07 18:34:54,771 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2022-04-07 18:34:54,775 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2022-04-07 18:34:54,776 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-07 18:34:54,776 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand  has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18)
[2022-04-07 18:34:54,776 INFO  L74              IsIncluded]: Start isIncluded. First operand 51 states. Second operand  has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18)
[2022-04-07 18:34:54,777 INFO  L87              Difference]: Start difference. First operand 51 states. Second operand  has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18)
[2022-04-07 18:34:54,780 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 18:34:54,780 INFO  L93              Difference]: Finished difference Result 51 states and 70 transitions.
[2022-04-07 18:34:54,780 INFO  L276                IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions.
[2022-04-07 18:34:54,781 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 18:34:54,781 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 18:34:54,782 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states.
[2022-04-07 18:34:54,782 INFO  L87              Difference]: Start difference. First operand  has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 51 states.
[2022-04-07 18:34:54,785 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 18:34:54,785 INFO  L93              Difference]: Finished difference Result 51 states and 70 transitions.
[2022-04-07 18:34:54,785 INFO  L276                IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions.
[2022-04-07 18:34:54,786 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 18:34:54,786 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 18:34:54,786 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-04-07 18:34:54,786 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-07 18:34:54,786 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18)
[2022-04-07 18:34:54,789 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions.
[2022-04-07 18:34:54,789 INFO  L78                 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 34
[2022-04-07 18:34:54,789 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-04-07 18:34:54,789 INFO  L478      AbstractCegarLoop]: Abstraction has 51 states and 70 transitions.
[2022-04-07 18:34:54,790 INFO  L479      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 18:34:54,790 INFO  L276                IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions.
[2022-04-07 18:34:54,790 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2022-04-07 18:34:54,790 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-07 18:34:54,790 INFO  L499         BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-07 18:34:54,803 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-04-07 18:34:54,995 WARN  L460      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 18:34:54,996 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-07 18:34:54,996 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-07 18:34:54,996 INFO  L85        PathProgramCache]: Analyzing trace with hash 419889614, now seen corresponding path program 1 times
[2022-04-07 18:34:54,996 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-07 18:34:54,996 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069490537]
[2022-04-07 18:34:54,996 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 18:34:54,997 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-07 18:34:55,010 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-07 18:34:55,011 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1308036881]
[2022-04-07 18:34:55,011 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 18:34:55,011 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 18:34:55,011 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-07 18:34:55,012 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-07 18:34:55,030 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-04-07 18:34:55,081 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 18:34:55,082 INFO  L263         TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-07 18:34:55,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-07 18:34:55,095 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-04-07 18:34:55,305 INFO  L272        TraceCheckUtils]: 0: Hoare triple {1061#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1061#true} is VALID
[2022-04-07 18:34:55,306 INFO  L290        TraceCheckUtils]: 1: Hoare triple {1061#true} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0)))  InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|}  AuxVars[]  AssignedVars[#NULL.offset, #NULL.base] {1061#true} is VALID
[2022-04-07 18:34:55,306 INFO  L290        TraceCheckUtils]: 2: Hoare triple {1061#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1061#true} is VALID
[2022-04-07 18:34:55,306 INFO  L284        TraceCheckUtils]: 3: Hoare quadruple {1061#true} {1061#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1061#true} is VALID
[2022-04-07 18:34:55,307 INFO  L272        TraceCheckUtils]: 4: Hoare triple {1061#true} [107] L-1-->mainENTRY: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1061#true} is VALID
[2022-04-07 18:34:55,307 INFO  L290        TraceCheckUtils]: 5: Hoare triple {1061#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|)  InVars {main_#t~nondet4=|v_main_#t~nondet4_2|}  OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1}  AuxVars[]  AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1061#true} is VALID
[2022-04-07 18:34:55,307 INFO  L272        TraceCheckUtils]: 6: Hoare triple {1061#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 50) 1 0))  InVars {main_~n~0=v_main_~n~0_17}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1061#true} is VALID
[2022-04-07 18:34:55,307 INFO  L290        TraceCheckUtils]: 7: Hoare triple {1061#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1)  InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1}  AuxVars[]  AssignedVars[assume_abort_if_not_~cond] {1061#true} is VALID
[2022-04-07 18:34:55,307 INFO  L290        TraceCheckUtils]: 8: Hoare triple {1061#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0))  InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  AuxVars[]  AssignedVars[] {1061#true} is VALID
[2022-04-07 18:34:55,307 INFO  L290        TraceCheckUtils]: 9: Hoare triple {1061#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1061#true} is VALID
[2022-04-07 18:34:55,308 INFO  L284        TraceCheckUtils]: 10: Hoare quadruple {1061#true} {1061#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 50) 1 0))  InVars {main_~n~0=v_main_~n~0_17}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1061#true} is VALID
[2022-04-07 18:34:55,308 INFO  L272        TraceCheckUtils]: 11: Hoare triple {1061#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0))  InVars {main_~n~0=v_main_~n~0_18}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1061#true} is VALID
[2022-04-07 18:34:55,308 INFO  L290        TraceCheckUtils]: 12: Hoare triple {1061#true} [114] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1)  InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1}  AuxVars[]  AssignedVars[assume_abort_if_not_~cond] {1061#true} is VALID
[2022-04-07 18:34:55,308 INFO  L290        TraceCheckUtils]: 13: Hoare triple {1061#true} [117] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0))  InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3}  AuxVars[]  AssignedVars[] {1061#true} is VALID
[2022-04-07 18:34:55,309 INFO  L290        TraceCheckUtils]: 14: Hoare triple {1061#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1061#true} is VALID
[2022-04-07 18:34:55,309 INFO  L284        TraceCheckUtils]: 15: Hoare quadruple {1061#true} {1061#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0))  InVars {main_~n~0=v_main_~n~0_18}  OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1061#true} is VALID
[2022-04-07 18:34:55,310 INFO  L290        TraceCheckUtils]: 16: Hoare triple {1061#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0))  InVars {main_~n~0=v_main_~n~0_6}  OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2}  AuxVars[]  AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID
[2022-04-07 18:34:55,311 INFO  L290        TraceCheckUtils]: 17: Hoare triple {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [120] L30-2-->L31: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID
[2022-04-07 18:34:55,311 INFO  L290        TraceCheckUtils]: 18: Hoare triple {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [126] L31-->L30-2: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_8 4294967296)))  InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_8}  OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_8}  AuxVars[]  AssignedVars[main_~q~0] {1114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID
[2022-04-07 18:34:55,313 INFO  L290        TraceCheckUtils]: 19: Hoare triple {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [120] L30-2-->L31: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID
[2022-04-07 18:34:55,313 INFO  L290        TraceCheckUtils]: 20: Hoare triple {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296)))  InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7}  OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7}  AuxVars[]  AssignedVars[] {1114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID
[2022-04-07 18:34:55,314 INFO  L290        TraceCheckUtils]: 21: Hoare triple {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [124] L52-2-->L39: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID
[2022-04-07 18:34:55,314 INFO  L272        TraceCheckUtils]: 22: Hoare triple {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {1061#true} is VALID
[2022-04-07 18:34:55,314 INFO  L290        TraceCheckUtils]: 23: Hoare triple {1061#true} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|)  InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1}  AuxVars[]  AssignedVars[__VERIFIER_assert_~cond] {1061#true} is VALID
[2022-04-07 18:34:55,314 INFO  L290        TraceCheckUtils]: 24: Hoare triple {1061#true} [134] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {1061#true} is VALID
[2022-04-07 18:34:55,315 INFO  L290        TraceCheckUtils]: 25: Hoare triple {1061#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1061#true} is VALID
[2022-04-07 18:34:55,315 INFO  L284        TraceCheckUtils]: 26: Hoare quadruple {1061#true} {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [151] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|)  InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|}  AuxVars[]  AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {1114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID
[2022-04-07 18:34:55,316 INFO  L272        TraceCheckUtils]: 27: Hoare triple {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [131] L39-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|)  InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {1061#true} is VALID
[2022-04-07 18:34:55,317 INFO  L290        TraceCheckUtils]: 28: Hoare triple {1061#true} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|)  InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1}  AuxVars[]  AssignedVars[__VERIFIER_assert_~cond] {1061#true} is VALID
[2022-04-07 18:34:55,317 INFO  L290        TraceCheckUtils]: 29: Hoare triple {1061#true} [134] L12-->L12-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0))  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3}  AuxVars[]  AssignedVars[] {1061#true} is VALID
[2022-04-07 18:34:55,317 INFO  L290        TraceCheckUtils]: 30: Hoare triple {1061#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1061#true} is VALID
[2022-04-07 18:34:55,318 INFO  L284        TraceCheckUtils]: 31: Hoare quadruple {1061#true} {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [152] __VERIFIER_assertEXIT-->L40: AOR: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] LVA: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|)  InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|}  AuxVars[]  AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {1114#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID
[2022-04-07 18:34:55,320 INFO  L272        TraceCheckUtils]: 32: Hoare triple {1114#(and (= main_~p~0 0) (= main_~h~0 0))} [135] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (let ((.cse0 (* v_main_~h~0_11 12))) (+ (* v_main_~r~0_17 (* v_main_~q~0_18 .cse0)) (* 4294967295 (* v_main_~r~0_17 (* v_main_~q~0_18 (* v_main_~p~0_18 16)))) (* (* v_main_~q~0_18 (* v_main_~q~0_18 (* v_main_~p~0_18 4))) 4294967295) (* 4294967295 (* v_main_~q~0_18 (* v_main_~n~0_20 .cse0))) (* 4294967295 (* v_main_~q~0_18 (* v_main_~h~0_11 v_main_~q~0_18))) (* v_main_~q~0_18 (* v_main_~p~0_18 (* v_main_~n~0_20 16))) (* v_main_~h~0_11 (* v_main_~h~0_11 v_main_~h~0_11)))) 4294967296) 0) 1 0))  InVars {main_~q~0=v_main_~q~0_18, main_~n~0=v_main_~n~0_20, main_~h~0=v_main_~h~0_11, main_~p~0=v_main_~p~0_18, main_~r~0=v_main_~r~0_17}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|}  AuxVars[]  AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1163#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-07 18:34:55,320 INFO  L290        TraceCheckUtils]: 33: Hoare triple {1163#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|)  InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|}  OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1}  AuxVars[]  AssignedVars[__VERIFIER_assert_~cond] {1167#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-07 18:34:55,321 INFO  L290        TraceCheckUtils]: 34: Hoare triple {1167#(<= 1 __VERIFIER_assert_~cond)} [133] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0)  InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2}  OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2}  AuxVars[]  AssignedVars[] {1062#false} is VALID
[2022-04-07 18:34:55,321 INFO  L290        TraceCheckUtils]: 35: Hoare triple {1062#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true  InVars {}  OutVars{}  AuxVars[]  AssignedVars[] {1062#false} is VALID
[2022-04-07 18:34:55,321 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2022-04-07 18:34:55,321 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-07 18:34:55,321 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-07 18:34:55,321 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069490537]
[2022-04-07 18:34:55,322 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-07 18:34:55,322 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308036881]
[2022-04-07 18:34:55,322 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308036881] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-07 18:34:55,322 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-07 18:34:55,322 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-07 18:34:55,322 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951655824]
[2022-04-07 18:34:55,322 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-07 18:34:55,323 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36
[2022-04-07 18:34:55,323 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2022-04-07 18:34:55,323 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with  has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 18:34:55,356 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-07 18:34:55,356 INFO  L554      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-07 18:34:55,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-07 18:34:55,357 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-07 18:34:55,357 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-07 18:34:55,358 INFO  L87              Difference]: Start difference. First operand 51 states and 70 transitions. Second operand  has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 18:34:58,381 WARN  L534   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2022-04-07 18:35:02,028 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 18:35:02,028 INFO  L93              Difference]: Finished difference Result 66 states and 89 transitions.
[2022-04-07 18:35:02,028 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2022-04-07 18:35:02,028 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36
[2022-04-07 18:35:02,029 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-07 18:35:02,029 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 18:35:02,031 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions.
[2022-04-07 18:35:02,031 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 18:35:02,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions.
[2022-04-07 18:35:02,035 INFO  L86        InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions.
[2022-04-07 18:35:02,110 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-04-07 18:35:02,112 INFO  L225             Difference]: With dead ends: 66
[2022-04-07 18:35:02,112 INFO  L226             Difference]: Without dead ends: 65
[2022-04-07 18:35:02,113 INFO  L912         BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2022-04-07 18:35:02,114 INFO  L913         BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2022-04-07 18:35:02,114 INFO  L914         BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 150 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time]
[2022-04-07 18:35:02,115 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 65 states.
[2022-04-07 18:35:02,119 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65.
[2022-04-07 18:35:02,119 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-07 18:35:02,120 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand  has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2022-04-07 18:35:02,120 INFO  L74              IsIncluded]: Start isIncluded. First operand 65 states. Second operand  has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2022-04-07 18:35:02,121 INFO  L87              Difference]: Start difference. First operand 65 states. Second operand  has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2022-04-07 18:35:02,124 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 18:35:02,124 INFO  L93              Difference]: Finished difference Result 65 states and 87 transitions.
[2022-04-07 18:35:02,124 INFO  L276                IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions.
[2022-04-07 18:35:02,125 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 18:35:02,125 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 18:35:02,125 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states.
[2022-04-07 18:35:02,126 INFO  L87              Difference]: Start difference. First operand  has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states.
[2022-04-07 18:35:02,129 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-07 18:35:02,129 INFO  L93              Difference]: Finished difference Result 65 states and 87 transitions.
[2022-04-07 18:35:02,130 INFO  L276                IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions.
[2022-04-07 18:35:02,130 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-07 18:35:02,130 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-04-07 18:35:02,130 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-04-07 18:35:02,130 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-07 18:35:02,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 65 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2022-04-07 18:35:02,134 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions.
[2022-04-07 18:35:02,134 INFO  L78                 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 36
[2022-04-07 18:35:02,134 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-04-07 18:35:02,134 INFO  L478      AbstractCegarLoop]: Abstraction has 65 states and 87 transitions.
[2022-04-07 18:35:02,135 INFO  L479      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-07 18:35:02,135 INFO  L276                IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions.
[2022-04-07 18:35:02,136 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2022-04-07 18:35:02,136 INFO  L491         BasicCegarLoop]: Found error trace
[2022-04-07 18:35:02,136 INFO  L499         BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-07 18:35:02,160 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2022-04-07 18:35:02,355 WARN  L460      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 18:35:02,356 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-07 18:35:02,356 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-04-07 18:35:02,356 INFO  L85        PathProgramCache]: Analyzing trace with hash 1513839050, now seen corresponding path program 1 times
[2022-04-07 18:35:02,356 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-07 18:35:02,356 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915308224]
[2022-04-07 18:35:02,357 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 18:35:02,357 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-07 18:35:02,378 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-07 18:35:02,379 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1209642096]
[2022-04-07 18:35:02,379 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-07 18:35:02,379 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-07 18:35:02,379 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-07 18:35:02,386 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-07 18:35:02,388 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process